When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks

Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu. When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. In Gautam Das 0001, Christopher M. Jermaine, Philip A. Bernstein, editors, Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018. pages 709-724, ACM, 2018. [doi]

@inproceedings{OuyangQCLZZ18,
  title = {When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks},
  author = {Dian Ouyang and Lu Qin and Lijun Chang and Xuemin Lin and Ying Zhang and Qing Zhu},
  year = {2018},
  doi = {10.1145/3183713.3196913},
  url = {http://doi.acm.org/10.1145/3183713.3196913},
  researchr = {https://researchr.org/publication/OuyangQCLZZ18},
  cites = {0},
  citedby = {0},
  pages = {709-724},
  booktitle = {Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, June 10-15, 2018},
  editor = {Gautam Das 0001 and Christopher M. Jermaine and Philip A. Bernstein},
  publisher = {ACM},
}