Michiel Blom, Sven O. Krumke, Willem De Paepe, Leen Stougie  Home/Search
Context Related
| zib.de/pub/zibpublicatio...ZR0009.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: zib.de/paperweb...=2000&pubtype=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible. Performance of algorithms is measured through their competitive ratio, comparing the outcome of the algorithms with that of an adversary who provides the... (Update)
Similar documents based on text: More All
1.6: The Online TSP against Fair Adversaries - Blom, Krumke, de Paepe, Stougie (2000) (Correct)
0.9: News from the Online Traveling Repairman - Krumke, de Paepe, Poensgen.. (2001) (Correct)
0.9: Online Bin Coloring - Krumke, de Paepe, Rambau, Stougie (2001) (Correct)
BibTeX entry: (Update)
M. Blom, S. O. Krumke, W. E. de Paepe, and L. Stougie, The online-TSP against fair adversaries, Proceedings of the 4th Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science, vol. 1767, Springer, 2000, pp. 137--149. http://citeseer.ist.psu.edu/article/blom00onlinetsp.html More
@article{ blom00onlinetsp,
author = "Michiel Blom and Sven O. Krumke and Willem de Paepe and Leen Stougie",
title = "The Online-{TSP} against Fair Adversaries",
journal = "Lecture Notes in Computer Science",
volume = "1767",
pages = "137--??",
year = "2000",
url = "citeseer.ist.psu.edu/article/blom00onlinetsp.html" }
Citations (may not include all citations):33 Lecture Notes in Computer Science (context) - Fiat, Woeginger et al. - 1998
31 Minimizing average completion time in the presence of releas.. - Philips, Stein et al. - 1995
26 Optimal on-line algorithms for single-machine scheduling - Hoogeveen, Vestjens - 1996
11 Online dial-a-ride problems: Minimizing the completion time - Ascheuer, Krumke et al. - 2000
10 Algorithms for the on-line traveling salesman (context) - Ausiello, Feuerstein et al. - 1999
6 The online dial-a-ride problem under reasonable load - Hauptmeier, Krumke et al. - 2000
4 line scheduling of two-machine open shops where jobs arrive .. - Chen, Vestjens et al. - 1997
4 Scheduling two machines with release times - Noga, Seiden - 1999
3 The online traveling salesman problem on the line (context) - Lipmann - 1999
2 Performance analysis of heterogenous multi-processor computi.. (context) - Liu, Liu - 1974
1 THE ONLINE-TSP AGAINST FAIR ADVERSARIES (context) - Borodin, El-Yaniv et al. - 1998
Documents on the same site (http://www.zib.de/paperweb/paperweb?year=2000&pubtype=1): More
Computer-aided design of novel siderophores.. - Meyer, Schnurre.. (2000) (Correct)
Affine Invariant Convergence Analysis for Inexact Augmented.. - Volkwein, WEISER (2000) (Correct)
An Uncoupling-Coupling Technique for Markov Chain Monte Carlo.. - Fischer (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC