English

Deterministic Padded Decompositions and Negative-Weight Shortest Paths

Data Structures and Algorithms 2026-04-09 v2
Authors: Jason Li
View on arXiv ↗ PDF ↗

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.

Keywords

shortest path problem dynamic graph algorithms graph algorithms

Cite

@article{arxiv.2511.07859,
  title  = {Deterministic Padded Decompositions and Negative-Weight Shortest Paths},
  author = {Jason Li},
  journal= {arXiv preprint arXiv:2511.07859},
  year   = {2026}
}

Comments

STOC 2026, 12 pages

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
2025-11-12
Data Structures and Algorithms · Computer Science
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Monika Henzinger, Jason Li, Satish Rao, Di Wang
2024-01-12
Data Structures and Algorithms · Computer Science
Sublinear Time Shortest Path in Expander Graphs
Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen
2023-08-01
Data Structures and Algorithms · Computer Science
Parameterized Complexity of Finding Dissimilar Shortest Paths
Ryo Funayama, Yasuaki Kobayashi, Takeaki Uno
2024-02-23
Data Structures and Algorithms · Computer Science
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition
Julia Chuzhoy, Thatchaphol Saranurak
2020-09-21
Data Structures and Algorithms · Computer Science
Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhoň, Christoph Grunau, Bernhard Haeupler, Goran Zuzic +1
2022-09-26
Data Structures and Algorithms · Computer Science
Holiest Minimum-Cost Paths and Flows in Surface Graphs
Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
2018-04-04
Data Structures and Algorithms · Computer Science
Near-Optimal Directed Low-Diameter Decompositions
Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
2025-02-11
Data Structures and Algorithms · Computer Science
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Lorenzo Balzotti, Paolo G. Franciosa
2023-05-05
Data Structures and Algorithms · Computer Science
A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
Muhammad Aasim Qureshi, Dr. Fadzil B. Hassan, Sohail Safdar, Rehan Akbar
2009-11-03
Data Structures and Algorithms · Computer Science
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
Aaron Bernstein
2017-05-30
Data Structures and Algorithms · Computer Science
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
2021-01-20
Data Structures and Algorithms · Computer Science
A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
Kuowen Chen, Nicole Wein, Yiran Zhang
2025-11-07
Distributed, Parallel, and Cluster Computing · Computer Science
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2018-09-20
Data Structures and Algorithms · Computer Science
Deterministic Weighted Expander Decomposition in Almost-linear Time
Jason Li, Thatchaphol Saranurak
2021-06-04
Data Structures and Algorithms · Computer Science
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu +4
2023-09-29
Data Structures and Algorithms · Computer Science
Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
Jason Li, Connor Mowry, Satish Rao
2025-10-28
Data Structures and Algorithms · Computer Science
Single-Source Shortest Paths with Negative Real Weights in $\tilde{O}(mn^{8/9})$ Time
Jeremy T. Fineman
2023-11-14
Data Structures and Algorithms · Computer Science
Deterministic Mincut in Almost-Linear Time
Jason Li
2026-05-07
Data Structures and Algorithms · Computer Science
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
Michał Pilipczuk, Giannos Stamoulis, Michał Włodarczyk
2025-05-07
Data Structures and Algorithms · Computer Science
Shortcutting for Negative-Weight Shortest Path
George Z. Li, Jason Li, Satish Rao, Junkai Zhang
2025-11-18
Data Structures and Algorithms · Computer Science
A Deterministic Parallel APSP Algorithm and its Applications
Adam Karczmarz, Piotr Sankowski
2021-01-08
Data Structures and Algorithms · Computer Science
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
Eyal Weiss, Ariel Felner, Gal A. Kaminka
2024-02-20
Data Structures and Algorithms · Computer Science
Fully Dynamic Shortest Paths in Sparse Digraphs
Adam Karczmarz, Piotr Sankowski
2024-08-27
Data Structures and Algorithms · Computer Science
Deterministic Edge Connectivity in Near-Linear Time
Ken-ichi Kawarabayashi, Mikkel Thorup
2018-10-30
R2 v1 2026-07-01T07:31:17.088Z