All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904)
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 5509591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time |
scientific article; zbMATH DE number 5509591 |
Statements
All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (English)
0 references
19 February 2009
0 references
shortest path
0 references
distance
0 references
spanner
0 references
0.8748634457588196
0 references
0.8629516363143921
0 references
0.8590267300605774
0 references
0.8590267300605774
0 references
