STOC2026Top-tier venue

Deterministic Padded Decompositions and Negative-Weight Shortest Paths

Jason Li

arXiv DOI Publisher

2026Year

6Citations

1Top-tier citations

Abstract

We obtain the first near-linear time deterministic algorithm for negative-weight single-source shortest paths on integer-weighted graphs. Our main ingredient is a deterministic construction of a padded decomposition on directed graphs, which may be of independent interest.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

What it claims
Who builds on it
How it compares
Where it falls short

You ask

Your agent calls

Luneget_paper_fulltext

Free to start. No credit card required.

Terminal

Install the CLI

$ lune papers fulltext 4f5c8d9b-a96c-4639-b3ed-82b40fd200a9

Cited by top-tier papers1

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path CoversBernhard Haeupler, Yonggang Jiang, Thatchaphol SaranurakSTOC 2026 · 5 citations

Ask how each one uses it

Builds on8

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines