Sciweavers

128 search results - page 6 / 26
» On Approximating Multi-Criteria TSP
Sort
View
STOC
2004
ACM
87views Algorithms» more  STOC 2004»
15 years 9 months ago
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
14 years 11 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 9 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
FOCS
2009
IEEE
15 years 4 months ago
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
Aaron Archer, MohammadHossein Bateni, Mohammad Tag...