You are not logged in | Log in

Graphic) TSP approximatio

Speaker(s)
Marcin Mucha
Affiliation
Uniwersytet Warszawski
Date
March 8, 2012, 12:15 p.m.
Room
room 5870
Title in Polish
Seminar
Seminar Algorithms

During the recent year, a lot of progress has been made on approximating the Traveling Salesman Problem and the Traveling Salesman Path Problem, and in particular their graphic variants. In this talk I will briefly survey the recent results and show in more detail the papers by Momke and Svensson, and my own.