Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, April 15, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Markus Bläser
Traveling salesperson problems with weights one and two have been studied for many years. They are an important special case of traveling salesperson problems with triangle inequality. Papadimitriou and Yannakakis showed that the undirected and henceforth the directed minimization problem is MaxSNP-complete.
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.
Automatic MiSe System Software Version 1.4803M | admin login