Algorithms for the universal and a priori TSP

Authors:
Frans Schalekamp;David B. Shmoys
Affiliations:
School of ORIE, Cornell University, 288 Rhodes Hall, Ithaca, NY 14853, USA;School of ORIE, Cornell University, 288 Rhodes Hall, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
2008

Citing 14
Cited 3

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
Spacefilling curves and the planar travelling salesman problem

Journal of the ACM (JACM)
A priori optimization

Operations Research
Sometimes Travelling is Easy: The Master Tour Problem

SIAM Journal on Discrete Mathematics
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
The Structure of Circular Decomposable Metrics

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
Universal approximations for TSP, Steiner tree, and set cover

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved lower and upper bounds for universal TSP in planar metrics

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oblivious network design

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O(N log N) planar travelling salesman heuristic based on spacefilling curves

Operations Research Letters
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem

Operations Research Letters

A constant approximation algorithm for the a priori traveling salesman problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Approximation algorithms for optimal decision trees and adaptive TSP problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved lower bounds for the universal and a priori TSP

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two simple results for generalizations of the traveling salesman problem (TSP): for the universal TSP, we show that one can compute a tour that is universally optimal whenever the input is a tree metric. A (randomized) O(logn)-approximation algorithm for the a priori TSP follows as a corollary.