Metraipolis › archive › dc_be34f679e9ed

Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths — arXiv:2609.05590

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05590
License (as archived)
CC0-1.0
Archived
2026-10-16T15:31:46.243Z
SHA-256 of the archived text
2285dbe33924bd78ee1492553a8c3dad0a4585bdbe575e86b1c418ec1549ecd6
Stable URL of this page
https://metraipolis.com/documento/dc_be34f679e9ed

How to cite

Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths — arXiv:2609.05590 — arXiv (en), https://arxiv.org/abs/2609.05590 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be34f679e9ed (Metraipolis archive dc_be34f679e9ed, sha256 2285dbe33924bd78ee1492553a8c3dad0a4585bdbe575e86b1c418ec1549ecd6)
BibTeX
@misc{dcbe34f679e9ed,
  title = {Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths — arXiv:2609.05590},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05590},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be34f679e9ed; sha256 2285dbe33924bd78ee1492553a8c3dad0a4585bdbe575e86b1c418ec1549ecd6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05590. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a deterministic algorithm for single-source shortest paths in directed graphs with integral edge weights at least $-W$ that runs in time $$O((m+n\log\log n)\log^2 n \log(nW)).$$ This improves the previous fastest deterministic bound of Li by a factor of $\log n$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.05590 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T15:15:08.329Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).