DSApr 8
Deterministic Padded Decompositions and Negative-Weight Shortest Paths
arXiv:2511.0785916.43 citationsh-index: 3
Predicted impact top 4% in DS · last 90 daysOriginality Highly original
AI Analysis
This solves a fundamental graph algorithm problem for computer scientists and practitioners, with potential applications in network routing and optimization.
The researchers tackled the problem of finding negative-weight single-source shortest paths on integer-weighted graphs by developing the first near-linear time deterministic algorithm, using a novel deterministic construction of padded decomposition on directed graphs as the main technical contribution.
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.