Computing Many-to-Many Shortest Paths Using Highway Hierarchies

Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner. Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007. SIAM, 2007. [doi]

@inproceedings{KnoppSSSW07,
  title = {Computing Many-to-Many Shortest Paths Using Highway Hierarchies},
  author = {Sebastian Knopp and Peter Sanders and Dominik Schultes and Frank Schulz and Dorothea Wagner},
  year = {2007},
  url = {http://www.siam.org/proceedings/alenex/2007/alx07_004knopps.pdf},
  researchr = {https://researchr.org/publication/KnoppSSSW07},
  cites = {0},
  citedby = {0},
  booktitle = {Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007},
  publisher = {SIAM},
}