Cristina Cornelio, Judy Goldsmith, et al.
JAIR
Paper
New kth-shortest path algorithm
Abstract
This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.
Related
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Arnold.L. Rosenberg
Journal of the ACM
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR