Faster single-source shortest paths with negative real weights via proper hop distance
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916513672331264 |
|---|---|
| author | Huang, Yufan Jin, Peter Quanrud, Kent |
| author_facet | Huang, Yufan Jin, Peter Quanrud, Kent |
| contents | The textbook algorithm for single-source shortest paths with real-valued edge weights runs in $O(m n)$ time on a graph with $m$ edges and $n$ vertices. A recent breakthrough algorithm by Fineman [Fin24] takes $\tilde O(m n^{8/9})$ randomized time. We present an $\tilde O(m n^{4/5})$ randomized time algorithm building on ideas from [Fin24]. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_04872 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Faster single-source shortest paths with negative real weights via proper hop distance Huang, Yufan Jin, Peter Quanrud, Kent Data Structures and Algorithms The textbook algorithm for single-source shortest paths with real-valued edge weights runs in $O(m n)$ time on a graph with $m$ edges and $n$ vertices. A recent breakthrough algorithm by Fineman [Fin24] takes $\tilde O(m n^{8/9})$ randomized time. We present an $\tilde O(m n^{4/5})$ randomized time algorithm building on ideas from [Fin24]. |
| title | Faster single-source shortest paths with negative real weights via proper hop distance |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.04872 |