Sciweavers

930 search results - page 3 / 186
» An Improved Approximation Algorithm for the Traveling Tourna...
Sort
View
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
13 years 10 months ago
Improved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
Zhi-Zhong Chen, Takayuki Nagoya
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 8 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
EUROCAST
2009
Springer
179views Hardware» more  EUROCAST 2009»
13 years 11 months ago
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem
In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
13 years 11 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha