BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Hardness of approximation and iterative rounding algorithms
DTSTART:20140718T130000
DTSTAMP:20260415T000620Z
UID:eb19298bc3a02783cf84b1a5f3928279e0691e4474c6572ebafd86c9
CATEGORIES:Conferences - Seminars
DESCRIPTION:Abbas Bazzi\nCandidacy exam\nExam president: Prof. Emre Telata
 r\nThesis director : Prof. Ola Svensson\nCo-examiner    : Prof. Nisheet
 h VishnoiResearch Proposal\nOptimal Inapproximability for Scheduling Probl
 ems via Structural Hardness for Hypergraph Vertex Cover by Sushant Sachdev
 a and Rishi Saket.Chapter 2 of "New Techniques for Probabilistically Check
 able Proofs and Inapproximability by Subhash Khot.Chapter 4 of "Iterative 
 Methods in Combinatorial Optimization" by L. Chi Lau\, R. Ravi\, M. Singh.
LOCATION:INF211 http://plan.epfl.ch/?lang=fr&room=inf211
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR