Skip to content

Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap.

Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, Ulf Leser

VenueBEDBT
Year2017
ProceedingsEDBT

Browse the full EDBT paper archive.