The Online TSP Against Fair Adversaries

References

• Ascheuer N., Krumke S. O., Rambau J. Online dial-a-ride problems: minimizing the completion time. Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (2000) (Springer Verlag, Lille) 639–650Volume 1770 of Lecture Notes in Computer ScienceCrossref, Google Scholar
• Ausiello G., Feuerstein E., Leonardi S., Stougie L., Talamo M. Algorithms for the on-line traveling salesman. Algorithmica (2000) . to appearGoogle Scholar
• Borodin A., El-Yaniv R.Online Computation and Competitive Analysis (1998) (Cambridge University Press, Cambridge) Google Scholar
• Chen B., Vestjens A. P. A., Woeginger G. J. On-line scheduling of two-machine open shops where jobs arrive over time. Journal of Combinatorial Optimization (1997) 1:355–365Crossref, Google Scholar
• Fiat A., Woeginger G. J.Online Algorithms: The State of the Art (1998) (pringer Verlag, Heidelberg) . Volume 1442 of Lecture Notes in Computer ScienceCrossref, Google Scholar
• Hoogeveen J. A., Vestjens A. P. A. Optimal on-line algorithms for single-machine scheduling. Proceedings of the 5th Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization (1996) (Springer Verlag, Berlin) 404–414Volume 1084 of Lecture Notes in Computer ScienceCrossref, Google Scholar
• Lipmann M.The online traveling salesman problem on the line (1999) (Department of Quantitative Economics, University of Amsterdam, The Netherlands) . Master's thesisGoogle Scholar
• Liu J. W. S., Liu C. L., Gelenbe E., Mahl R. Performance analysis of heterogenous multi-processor computing systems. Computer Architectures and Networks (1974) (North Holland, Amsterdam, The Netherlands) 331–343Google Scholar
• Philips C., Stein C., Wein J. Minimizing average completion time in the presence of release dates. Proceedings of the 4th Workshop on Algorithms and Data Structures (1995) (Springer Verlag, Berlin) 86–97Volume 995 of Lecure Notes in Computer ScienceCrossref, Google Scholar