Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Conference paper
On Trajectory Augmentations for Off-Policy Evaluation
Ge Gao, Qitong Gao, et al.
ICLR 2024
Dzung Phan, Vinicius Lima
INFORMS 2023
Jungo Kasai, Kun Qian, et al.
ACL 2019