Finding k-shortest paths with limited overlap

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser, David B. Blumenthal. Finding k-shortest paths with limited overlap. VLDB J., 29(5):1023-1047, 2020. [doi]

@article{ChondrogiannisB20,
  title = {Finding k-shortest paths with limited overlap},
  author = {Theodoros Chondrogiannis and Panagiotis Bouros and Johann Gamper and Ulf Leser and David B. Blumenthal},
  year = {2020},
  doi = {10.1007/s00778-020-00604-x},
  url = {https://doi.org/10.1007/s00778-020-00604-x},
  researchr = {https://researchr.org/publication/ChondrogiannisB20},
  cites = {0},
  citedby = {0},
  journal = {VLDB J.},
  volume = {29},
  number = {5},
  pages = {1023-1047},
}