Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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

Approximation algorithms for Max-ATSP with distances zero and one

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login