BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Hardness of Approximation and Randomized Rounding
DTSTART:20140711T150000
DTSTAMP:20260406T103747Z
UID:23125702a28108eb1329c316c49452bbd7318889234e224ca407ff32
CATEGORIES:Conferences - Seminars
DESCRIPTION:Ashkan Norouzi Fard\nCandidacy exam\nExam president: Prof. Fri
 edrich Eisenbrand\nThesis director : Prof. Ola Svensson\nCo-examiner   
  : Prof. Volkan Cevher\nResearch ProposalDependent Randomized Rounding for
  Matroid Polytopes and Applications by Chandra Chekuri\, et al.Improved Ap
 proximation Algortithms for the Uncapacited Facility Location Problem (fro
 m 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. Vazi
 rani.
LOCATION:INF211 http://plan.epfl.ch/?lang=fr&room=inf211
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR