Efficient Rounding of Strong Convex Relaxations
Event details
| Date | 17.06.2013 |
| Hour | 15:00 |
| Speaker | Mr Christos Kalaitzis |
| Location | |
| Category | Conferences - Seminars |
EDIC Candidacy Exam:
Exam president: Prof. Rudiger Urbanke
Thesis director: Prof. Ola Svensson
Co-examiner: Prof. Friedrich Eisenbrand
Research Proposal
Rounding semidefinite programming hierarchies via global correlation by Boaz Barak et al.
An approximation algorithm for the generalized assignment problem by David B. Shmoys and Eva Tardos.
Approximating bin packing within O(log OPT log log OPT) bins by Thomas Rothvoss.
Exam president: Prof. Rudiger Urbanke
Thesis director: Prof. Ola Svensson
Co-examiner: Prof. Friedrich Eisenbrand
Research Proposal
Rounding semidefinite programming hierarchies via global correlation by Boaz Barak et al.
An approximation algorithm for the generalized assignment problem by David B. Shmoys and Eva Tardos.
Approximating bin packing within O(log OPT log log OPT) bins by Thomas Rothvoss.
Practical information
- General public
- Free
Contact
- Ms Evelyn Duperrex