Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Sven Oliver Krumke' in GoogleThis author has not been identified. Look up 'Luigi Laura' in GoogleThis author has not been identified. Look up 'Maarten Lipmann' in GoogleThis author has not been identified. Look up 'Alberto Marchetti-Spaccamela' in GoogleThis author has not been identified. Look up 'Willem de Paepe' in GoogleThis author has not been identified. Look up 'Diana Poensgen' in GoogleThis author has not been identified. Look up 'Leen Stougie' in Google

runs on WebDSL