Shortcutting for Negative-Weight Shortest Path
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914160313368576 |
|---|---|
| author | Li, George Z. Li, Jason Rao, Satish Zhang, Junkai |
| author_facet | Li, George Z. Li, Jason Rao, Satish Zhang, Junkai |
| contents | Consider the single-source shortest paths problem on a directed graph with real-valued edge weights. We solve this problem in $O(n^{2.5}\log^{4.5}n)$ time, improving on prior work of Fineman (STOC 2024) and Huang-Jin-Quanrud (SODA 2025, 2026) on dense graphs. Our main technique is an shortcutting procedure that iteratively reduces the number of negative-weight edges along shortest paths by a constant factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12714 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Shortcutting for Negative-Weight Shortest Path Li, George Z. Li, Jason Rao, Satish Zhang, Junkai Data Structures and Algorithms Consider the single-source shortest paths problem on a directed graph with real-valued edge weights. We solve this problem in $O(n^{2.5}\log^{4.5}n)$ time, improving on prior work of Fineman (STOC 2024) and Huang-Jin-Quanrud (SODA 2025, 2026) on dense graphs. Our main technique is an shortcutting procedure that iteratively reduces the number of negative-weight edges along shortest paths by a constant factor. |
| title | Shortcutting for Negative-Weight Shortest Path |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2511.12714 |