Asymmetric Traveling Salesperson and Algorithmic Techniques for Hard Problems
Event details
| Date | 24.08.2015 |
| Hour | 10:00 |
| Speaker | Jakub Tarnawski |
| Location | |
| Category | Conferences - Seminars |
EDIC Candidacy Exam:
Exam president: Prof. Arjen Lenstra
Thesis director: Prof. Ola Svensson
Co-examiner: Prof. Friedrich Eisenbrand
Research Proposal
Subexponential Algorithms for Unique Games and Related Problems by S. Arora, B. Barak, D. Steurer (the part about small set expansion).
Approximating ATSP by Relaxing Connectivity by O. Svensson.
Constructive discrepancy minimization for convex sets by T. Rothvoss.
Exam president: Prof. Arjen Lenstra
Thesis director: Prof. Ola Svensson
Co-examiner: Prof. Friedrich Eisenbrand
Research Proposal
Subexponential Algorithms for Unique Games and Related Problems by S. Arora, B. Barak, D. Steurer (the part about small set expansion).
Approximating ATSP by Relaxing Connectivity by O. Svensson.
Constructive discrepancy minimization for convex sets by T. Rothvoss.
Practical information
- General public
- Free
Contact
- Evelyn Duperrex