Finding Top-k Shortest Paths with Diversity

Huiping Liu, Cheqing Jin, Bin Yang 0002, Aoying Zhou. Finding Top-k Shortest Paths with Diversity. IEEE Trans. Knowl. Data Eng., 30(3):488-502, 2018. [doi]

@article{LiuJYZ18,
  title = {Finding Top-k Shortest Paths with Diversity},
  author = {Huiping Liu and Cheqing Jin and Bin Yang 0002 and Aoying Zhou},
  year = {2018},
  doi = {10.1109/TKDE.2017.2773492},
  url = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2017.2773492},
  researchr = {https://researchr.org/publication/LiuJYZ18},
  cites = {0},
  citedby = {0},
  journal = {IEEE Trans. Knowl. Data Eng.},
  volume = {30},
  number = {3},
  pages = {488-502},
}