5 citations · 6 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
Jason Li, Connor Mowry, Satish Rao
We present a faster algorithm for low-diameter decompositions on directed graphs, matching the loss factor from Bringmann, Fischer, Haeupler, and Latypov (ICA…
cs.DS2025
Simpler and Faster Directed Low-Diameter Decompositions
Jason Li
We present a simpler and faster algorithm for low-diameter decompositions on directed graphs, matching the loss factor from Bringmann, Fischer, Haeupler, and…
cs.DS2024
A Bottom-Up Algorithm for Negative-Weight SSSP with Integrated Negative Cycle Finding
Jason Li, Connor Mowry
We present a simplified algorithm for solving the Negative-Weight Single-Source Shortest Paths (SSSP) problem, focusing on enhancing clarity and practicality over prior methods. Ou…