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. 200-214 2002 conf/approx/2002 APPROX http://link.springer.de/link/service/series/0558/bibs/2462/24620200.htm db/conf/approx/approx2002.html#KrumkeLLMPPS02