Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
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
Junchen Jiang, Yue Zhu
OSSNA 2025
Kaiyuan Zhang, Guanhong Tao, et al.
ICLR 2023
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR