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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, October 13, 2009, 12:15 pm

**Duration**: This information is not available in the database

**Location**: OAT S15/S16/S17

**Speaker**: Heidi Gebauer

The Traveling Salesman Problem (TSP) is one of the most fundamental NP-hard problems. The best known algorithm is the classical dynamic programming solution from 1962, discovered by Bellman, and, independently, by Held and Karp. It runs in time within a polynomial factor of 2^n where n is the number of cities. It is still open whether TSP in this general form can be solved in time O(1.999^n). For graphs of small degree (i.e. 3 or 4), though, some faster algorithms are known. But for the case where the degree bound, k, is at least 5, not much has been known so far. Björklund, Husfeldt, Kaski and Koivisto showed that TSP can be solved in (2 - epsilon)^n where epsilon is a constant depending on k only. They slightly modified the dynamic programming algorithm of Held and Karp and applied a lemma of Shearer which actually is about entropy.

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: The Travelling Salesman Problem in Bounded Degree Graphs. Proc. 35th International Colloquium on Automata, Languages, and Programming (ICALP), Part I. Lecture Notes in Computer Science 5125, (2008), 198-209 .

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