Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Tim Nonner and Marco Laumanns. Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 15-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{nonner_et_al:OASIcs.ATMOS.2014.15, author = {Nonner, Tim and Laumanns, Marco}, title = {{Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {15--24}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.15}, URN = {urn:nbn:de:0030-drops-47494}, doi = {10.4230/OASIcs.ATMOS.2014.15}, annote = {Keywords: Shortest Path, Stochastic Optimization, Public Transportation} }
Published in: OASIcs, Volume 42, 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2014)
Vianney Boeuf and Frédéric Meunier. Online Train Shunting. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 42, pp. 34-45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{boeuf_et_al:OASIcs.ATMOS.2014.34, author = {Boeuf, Vianney and Meunier, Fr\'{e}d\'{e}ric}, title = {{Online Train Shunting}}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {34--45}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-75-0}, ISSN = {2190-6807}, year = {2014}, volume = {42}, editor = {Funke, Stefan and Mihal\'{a}k, Mat\'{u}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2014.34}, URN = {urn:nbn:de:0030-drops-47512}, doi = {10.4230/OASIcs.ATMOS.2014.34}, annote = {Keywords: Bipartite graph, competitive analysis, online algorithm, train shunting problem, vertex cover} }
Published in: OASIcs, Volume 25, 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2012)
Tim Nonner and Alexander Souza. Optimal Algorithms for Train Shunting and Relaxed List Update Problems. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 97-107, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@InProceedings{nonner_et_al:OASIcs.ATMOS.2012.97, author = {Nonner, Tim and Souza, Alexander}, title = {{Optimal Algorithms for Train Shunting and Relaxed List Update Problems}}, booktitle = {12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {97--107}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-45-3}, ISSN = {2190-6807}, year = {2012}, volume = {25}, editor = {Delling, Daniel and Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.97}, URN = {urn:nbn:de:0030-drops-37066}, doi = {10.4230/OASIcs.ATMOS.2012.97}, annote = {Keywords: Train shunting, optimal algorithm, independent set, dynamic programming} }
Feedback for Dagstuhl Publishing