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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Monday, August 22, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Naveen Garg (IIT New Delhi)

A faster algorithm for computing the Held-Karp bound

The Held-Karp bound is one of the better known lower bounds on the cost of a traveling salesman tour. In this talk I will present an algorithm for computing a 1+ε approximation to the Held-karp bound in time O((m/ε)2). Our algorithm is a Lagrangean relaxation algorithm and uses minimum weight branching computations as a subroutine.

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

Previous talks by year:   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