Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
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
Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Aditya Saxena, Shambhavi Shanker, et al.
AGU 2025
Conference paper
On Trajectory Augmentations for Off-Policy Evaluation
Ge Gao, Qitong Gao, et al.
ICLR 2024