Deterministic Padded Decompositions and Negative-Weight Shortest Paths
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915921611718656 |
|---|---|
| author | Li, Jason |
| author_facet | Li, Jason |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07859 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Deterministic Padded Decompositions and Negative-Weight Shortest Paths Li, Jason Data Structures and Algorithms 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. |
| title | Deterministic Padded Decompositions and Negative-Weight Shortest Paths |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.07859 |