Deterministic Padded Decompositions and Negative-Weight Shortest Paths
Jason Li
TL;DR
This paper introduces a deterministic near-linear time algorithm for negative-weight shortest paths in integer-weighted graphs, utilizing a novel padded decomposition construction.
Contribution
It presents the first deterministic algorithm with near-linear time complexity for this problem, based on a new padded decomposition technique.
Findings
First deterministic near-linear time algorithm for negative-weight shortest paths.
Deterministic padded decomposition construction may be of independent interest.
Achieves efficiency improvements over previous randomized approaches.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.