Two short notes on the on-line travelling salesman: handling times and lookahead

Authors:
Peter Damaschke
Affiliations:
Department of Computer Science, Chalmers University of Technology, Eklandagatan 86, 41296 Göteborg, Sweden
Venue:
Theoretical Computer Science
Year:
2002

Citing 4
Cited 0

Online computation and competitive analysis

Online computation and competitive analysis
A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Serving Requests with On-line Routing

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
News from the online traveling repairman

Theoretical Computer Science - Mathematical foundations of computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study extensions of the on-line travelling salesman problem. Our results are: The optimal competitive ratio 2 for arbitrary metric spaces also holds in the case of nonzero handling times. The optimal competitive ratio 3/2 on the half-line cannot be improved by randomization, but there is a 4/3-competitive algorithm under the assumption that the server is notified when the last request has been released. This ratio is also optimal.