Skip to main content
Article thumbnail
Location of Repository

New Competitive Ratios for Generalized Online Routing

By Patrick Jaillet and Michael R. Wagner

Abstract

We consider online routing optimization problems where the objective is to minimize the time needed to visit a set of locations under various constraints; the problems are online because the set of locations are revealed incrementally over time. We make no probabilistic assumptions whatsoever about the problem data. We consider two main problems: (1) the online Traveling Salesman Problem (TSP) with precedence and capacity constraints and (2) the online TSP with m salesmen. For both problems we propose online algorithms, each with a competitive ratio of 2; for the m-salesmen problem, we show our result is best-possible. We also consider polynomial-time online algorithms as well as various generalizations of our results.

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4039
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cbe.csueastbay.edu/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.