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