On minimizing the maximum flow time in the online Dial-a-Ride problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3879 LNCS, Issue , 2006, Pages 258-269

  Krumke, Sven O ^a   De Paepe, Willem E ^b   Poensgen, Diana ^c   Lipmann, Maarten ^b   Marchetti Spaccamela, Alberto ^d   Stougie, Leen ^b  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c ZUSE INSTITUTE BERLIN   (Germany)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SERVERS; TRAVELING SALESMAN PROBLEM;

DEFINITION COMPETITIVE RATIO; DIAL-A-RIDE PROBLEM; ONLINE ALGORITHMS; UNBOUNDED METRIC SPACES;

ONLINE SYSTEMS;

EID: 33745611448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671411_20     Document Type: Conference Paper

References (14)

1. N. Ascheuer, S. O. Krumke, and J. Rambau. Online dial-a-ride problems: Minimizing the completion time. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 639-650. Springer, 2000.
2. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Algorithms for the on-line traveling salesman. Algorithmica, 29(4):560-581, 2001.
3. M. Blom, S. O. Krumke, W. E. de Paepe, and L. Stougie. The online-TSP against fair adversaries. Informs Journal on Computing, 13(2):138-148, 2001.
4. A preliminary version appeared in the Proceedings of the 4th Italian Conference on Algorithms and Complexity, 2000, vol. 1767 of Lecture Notes in Computer Science.
5. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. W. E. de Paepe, J. K. Lenstra, J. Sgall, R. A. Sitters, and L. Stougie. Computer-aided complexity classification of dial-a-ride problems. Informs Journal on Computing, 2003. To appear.
7. E. Feuerstein and L. Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, 268(1):91-105, 2001.
8. M. Grötschel, S. O. Krumke, and J. Rambau, editors. Online Optimization of Large Scale Systems. Springer, Berlin Heidelberg New York, 2001.
9. D. Hauptmeier, S. O. Krumke, and J. Rambau. The online dial-a-ride problem under reasonable load. In Proceedings of the 4th Italian Conference on Algorithms and Complexity, volume 1767 of Lecture Notes in Computer Science, pages 125-136. Springer, 2000.
10. S. Irani, X. Lu, and A. Regan. On-line algorithms for the dynamic traveling repair problem. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 517-524, 2002.
11. S. O. Krumke. Online Optimization: Competitive Analysis and Beyond. Habilitationsschrift, Technische Universität Berlin, 2002.
12. S. O. Krumke, W. E. de Paepe, D. Poensgen, and L. Stougie. News from the on-line traveling repairman. Theoretical Computer Science, 295(1-3):279-294, 2003.
13. A preliminary version appeared in the Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, 2001, vol. 2136 of Lecture Notes in Computer Science.
14. S. O. Krumke, L. Laura, M. Lipmann, A. Marchetti-Spaccamela, W. E. de Paepe, D. Poensgen, and L. Stougie. Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 2462 of Lecture Notes in Computer Science, pages 200-214. Springer, 2002.