BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Monday Seminars : Better approximation algorithms for classical
  optimization problems ?
DTSTART:20120227T161500
DTEND:20120227T173000
DTSTAMP:20260406T022327Z
UID:d0d26ebd3aa533c195edf7487cd637d82e4100d1fc0b892221f33d03
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Ola Svensson\, Postdoctoral Researcher EPFL - IC Faculty c
 andidate\nAbstract:\nApproximation algorithms are motivated by the fact th
 at for many\nimportant optimization problems we cannot hope to efficiently
  find an\noptimal solution.  Instead\, we have to settle for second best 
 - a\nsolution that is close to being optimal. Some of the earliest success
 \nstories of this paradigm deal with fundamental optimization problems\nar
 ising in operations research\, such as the problem of scheduling with\npre
 cedence constraints (Graham 66) and the traveling salesman problem\n(Chris
 tofides 76).\n\nIn spite of significant effort\, it remains unknown whethe
 r many of\nthese problems admit better algorithms. In this talk\, we will 
 discuss\nrecent progress on answering this question for some of the most\n
 classical optimization problems\, including the problems mentioned above.\
 nIn particular\, we will focus on our new results for the traveling\nsales
 man problem.\n\n\nBiography: \nOla Svensson is a Post-Doc in Prof. Amin Sh
 okrollahi's lab on\nalgorithms at EPFL. Before coming to EPFL\, he spent 2
  years as a\nPost-Doc in Prof. Johan Håstad's group on approximation algo
 rithms at\nKTH and 3.5 years (out of which half a year was spent at MIT) a
 s a PhD\nstudent at IDSIA under the supervision of Dr. Monaldo Mastrolilli
 .\nHis research focuses on understanding the complexity of fundamental\nop
 timization problems by both giving efficient (approximation)\nalgorithms a
 nd lower bounds.
LOCATION:INM 202 http://plan.epfl.ch/?lang=fr&room=INM202
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR