Hardness of Approximation and Randomized Rounding
Event details
| Date | 11.07.2014 |
| Hour | 15:00 |
| Speaker | Ashkan Norouzi Fard |
| Location | |
| Category | Conferences - Seminars |
Candidacy exam
Exam president: Prof. Friedrich Eisenbrand
Thesis director : Prof. Ola Svensson
Co-examiner : Prof. Volkan Cevher
Research Proposal
Dependent Randomized Rounding for Matroid Polytopes and Applications by Chandra Chekuri, et al.
Improved Approximation Algortithms for the Uncapacited Facility Location Problem (from page 4-9) by F.A. Chudak and D. Shmoys.
Hardness of Approximation chapter 29 of Approximation Algorithms book (from page: 306-329) by Vijay V. Vazirani.
Exam president: Prof. Friedrich Eisenbrand
Thesis director : Prof. Ola Svensson
Co-examiner : Prof. Volkan Cevher
Research Proposal
Dependent Randomized Rounding for Matroid Polytopes and Applications by Chandra Chekuri, et al.
Improved Approximation Algortithms for the Uncapacited Facility Location Problem (from page 4-9) by F.A. Chudak and D. Shmoys.
Hardness of Approximation chapter 29 of Approximation Algorithms book (from page: 306-329) by Vijay V. Vazirani.
Practical information
- General public
- Free
Contact
- Evelyn Duperrex