On minimizing the maximum flow time in the online dial-a-ride problem

2006

Presented at the Workshop on Approximation and Online Algorithms

Additional Metadata
THEME	Logistics (theme 3)
Publisher	Springer
Series	Lecture Notes in Computer Science
Conference	Workshop on Approximation and Online Algorithms
Organisation	Networks and Optimization
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Krumke, S. O., de Paepe, W. E., Poensgen, D., Lipmann, M., Marchetti Spaccamela, A.& Stougie, L. (2006). On minimizing the maximum flow time in the online dial-a-ride problem. Proceedings of Workshop on Approximation and Online Algorithms 2006 (3), 258–269.

Publication