Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (Q5088993)
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 7559260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. |
scientific article; zbMATH DE number 7559260 |
Statements
18 July 2022
0 references
single-source shortest paths
0 references
weighted unit-disk graphs
0 references
geometric graph algorithms
0 references
0 references
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (English)
0 references
0.9979854822158812
0 references
0.8830022811889648
0 references
0.8581345677375793
0 references
