Abstract
We deal with an online problem arising from bus/tram/train disposition problems. In particular, we look at the case in which the delay is unknown and the vehicle can only wait in a station so as to minimize the passengers' waiting time. We present deterministic polynomial-time optimal algorithms and matching lower bounds for several problem versions. In addition, all lower bounds also apply to randomized algorithms, thus implying that using randomization does not help. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Anderegg, L., Penna, P., & Widmayer, P. (2009). Online train disposition: To wait or not to wait? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5868 LNCS, pp. 387–398). https://doi.org/10.1007/978-3-642-05465-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
