BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Local Search and the General Assignment Problem - Márton Havasi\,
  Churchill College
DTSTART:20150128T190000Z
DTEND:20150128T194000Z
UID:TALK56846@talks.cam.ac.uk
CONTACT:Jasper Lee
DESCRIPTION:What can one do when faced with an NP-hard optimisation proble
 m? We will examine local search algorithms and their potential to approxim
 ate difficult tasks\, where the best known exact algorithm has exponential
  time complexity. In particular\, I will show how we can apply local searc
 h to give approximate solutions with bounded error to the General Assignme
 nt Problem (GAP) in polynomial time.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR