Engineering Time-Dependent Many-to-Many Shortest Paths Computation

Robert Geisberger, Peter Sanders. Engineering Time-Dependent Many-to-Many Shortest Paths Computation. In Thomas Erlebach, Marco E. Lübbecke, editors, ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010. Volume 14 of OASICS, pages 74-87, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010. [doi]

@inproceedings{GeisbergerS10,
  title = {Engineering Time-Dependent Many-to-Many Shortest Paths Computation},
  author = {Robert Geisberger and Peter Sanders},
  year = {2010},
  doi = {10.4230/OASIcs.ATMOS.2010.74},
  url = {http://dx.doi.org/10.4230/OASIcs.ATMOS.2010.74},
  researchr = {https://researchr.org/publication/GeisbergerS10},
  cites = {0},
  citedby = {0},
  pages = {74-87},
  booktitle = {ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems,  Liverpool, United Kingdom, September 6-10, 2010},
  editor = {Thomas Erlebach and Marco E. Lübbecke},
  volume = {14},
  series = {OASICS},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
}