On-line algorithms for the dynamic traveling repair problem

Authors:
Sandy Irani;Xiangwen Lu;Amelia Regan
Affiliations:
UC Irvine;UC Irvine;UC Irvine
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 4
Cited 3

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

Operations Research
Competitive algorithms for server problems

Journal of Algorithms
Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

Operations Research
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen

SIAM Journal on Computing

Algorithms for the on-line quota traveling salesman problem

Information Processing Letters
On minimizing the maximum flow time in the online dial-a-ride problem

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On the online dial-a-ride problem with time-windows

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the dynamic traveling repair problem (DTRP) in which requests with deadlines arrive through time on points in a metric space. Servers move from point to point at constant speed. The goal is to plan the motion of servers so that the maximum number of requests are met by their deadline. We consider a restricted version of the problem in which there is a single server and the length of time between the arrival of a request and its deadline is uniform. We give upper bounds for the competitive ratio of two very natural algorithms as well as several lower bounds for any deterministic algorithm. Most of the result in this paper are expressed a function of β, the diameter of the metric space.