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: Tuesday, March 22, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Shankar Ram Lakshminarayanan

Metric Traveling Salesman Games

The Traveling Salesman game is given by the tuple (N, cD) where N is the set of cities (or the vertices of the complete graph) and cD is a real function defined on all subsets of N where D is the underlying cost matrix, with cD(S) being the cost of a minimum cost Hamiltonian tour through the vertices S and "0" where 0 ∉ N is called as the home city. The core of this game is defined to be the set of all n-dimensional real vectors x, such that x(N) = cD(N) and x(S) <= cD(S) for all subsets S. In this talk, we show that the problem of determining whether the core of a TS game with D satisfying triangle inequality (Metric TS game) is empty or not, is NP-Complete. Further, we define approximate core allocation and show some results pertaining to the Asymmetric TS game.

(Joint work with Markus Bläser)

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