Sciweavers

252 search results - page 10 / 51
» tsp 2008
Sort
View
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
14 years 11 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Philip N. Klein
IPL
2007
78views more  IPL 2007»
14 years 11 months ago
LP-based solution methods for the asymmetric TSP
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
Vardges Melkonian
CSJM
2006
59views more  CSJM 2006»
14 years 11 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 11 months ago
Approximating Multi-Criteria Max-TSP
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
Markus Bläser, Bodo Manthey, Oliver Putz
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
15 years 1 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