New kth-shortest path algorithm

H. Maruyama

IEICE Transactions on Information and Systems

Paper

01 Mar 1993

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.

Paper

Sparse Dynamic Programming I: Linear Cost Functions

David Eppstein, Zvi Galil, et al.

Journal of the ACM

Conference paper

Low-resource deep entity resolution with transfer and active learning

Jungo Kasai, Kun Qian, et al.

ACL 2019

Conference paper

Learning Reduced Order Dynamics via Geometric Representations

Imran Nasim, Melanie Weber

SCML 2024

Talk

Scalable and Efficient LLM Serving with the vLLM Production Stack

Junchen Jiang, Yue Zhu

OSSNA 2025

View all publications

Abstract

Related

Sparse Dynamic Programming I: Linear Cost Functions

Low-resource deep entity resolution with transfer and active learning

Learning Reduced Order Dynamics via Geometric Representations

Scalable and Efficient LLM Serving with the vLLM Production Stack