A deterministic almost-tight distributed algorithm for approximating single-source shortest paths (Q4997313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7364224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic almost-tight distributed algorithm for approximating single-source shortest paths |
scientific article; zbMATH DE number 7364224 |
Statements
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (English)
0 references
29 June 2021
0 references
distributed algorithms
0 references
shortest paths
0 references
approximation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9975415468215942
0 references
0.9060643315315248
0 references
0.8549261093139648
0 references
0.8497331738471985
0 references
