STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A guessing game and randomized online algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On-line single-server dial-a-ride problems
Theoretical Computer Science
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Scalability of dial-a-ride systems—a case study to assess utilities of ubiquitous mass user support
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
The on-line asymmetric traveling salesman problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In the traveling repairman problem (TRP), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of the cities is minimized. Given a tour, the completion time of a city is the time traveled on the tour before the city is reached. In the online traveling repairman problem OLTRP requests for visits to cities arrive online while the repairman is traveling. We analyze the performance of algorithms for the online problem using competitive analysis, where the cost of an online algorithm is compared to that of an optimal offline algorithm. Feuerstein and Stougie [8] present a 9-competitive algorithm for the OlTrp on the real line. In this paper we show how to use techniques from online-scheduling to obtain a 6-competitive deterministic algorithm for the OlTrp on any metric space. We also present a randomized algorithm with competitive ratio of 3/ln 2 2.1282 for the L-OLDARP on the line, 4e-5/2e-3 2.41041 for the L-OLDARP on general metric spaces, 2 for the OLTRP on the line, and 7/3 for the OLTRP on general metric spaces.