Sciweavers

128 search results - page 1 / 26
» On Approximating Multi-Criteria TSP
Sort
View
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 4 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
STACS
2009
Springer
13 years 11 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 4 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
TSP
2008
98views more  TSP 2008»
13 years 4 months ago
A Low Complexity Euclidean Norm Approximation
Changkyu Seol, Kyungwhoon Cheun
CORR
2012
Springer
224views Education» more  CORR 2012»
12 years 15 days ago
On Approximation Lower Bounds for TSP with Bounded Metrics
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
Marek Karpinski, Richard Schmied