Hardness of approximation and iterative rounding algorithms
Event details
| Date | 18.07.2014 |
| Hour | 13:00 |
| Speaker | Abbas Bazzi |
| Location | |
| Category | Conferences - Seminars |
Candidacy exam
Exam president: Prof. Emre Telatar
Thesis director : Prof. Ola Svensson
Co-examiner : Prof. Nisheeth Vishnoi
Research Proposal
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover by Sushant Sachdeva and Rishi Saket.
Chapter 2 of "New Techniques for Probabilistically Checkable Proofs and Inapproximability by Subhash Khot.
Chapter 4 of "Iterative Methods in Combinatorial Optimization" by L. Chi Lau, R. Ravi, M. Singh.
Exam president: Prof. Emre Telatar
Thesis director : Prof. Ola Svensson
Co-examiner : Prof. Nisheeth Vishnoi
Research Proposal
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover by Sushant Sachdeva and Rishi Saket.
Chapter 2 of "New Techniques for Probabilistically Checkable Proofs and Inapproximability by Subhash Khot.
Chapter 4 of "Iterative Methods in Combinatorial Optimization" by L. Chi Lau, R. Ravi, M. Singh.
Practical information
- General public
- Free
Contact
- Evelyn Duperrex