Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie. Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. In Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani, editors, Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings. Volume 2462 of Lecture Notes in Computer Science, pages 200-214, Springer, 2002. [doi]
@inproceedings{KrumkeLLMPPS02,
title = {Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem},
author = {Sven Oliver Krumke and Luigi Laura and Maarten Lipmann and Alberto Marchetti-Spaccamela and Willem de Paepe and Diana Poensgen and Leen Stougie},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2462/24620200.htm},
tags = {data-flow},
researchr = {https://researchr.org/publication/KrumkeLLMPPS02},
cites = {0},
citedby = {0},
pages = {200-214},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings},
editor = {Klaus Jansen and Stefano Leonardi and Vijay V. Vazirani},
volume = {2462},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44186-7},
}