An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for computing shortest paths in weighted 3-d domains |
scientific article; zbMATH DE number 6195027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for computing shortest paths in weighted 3-d domains |
scientific article; zbMATH DE number 6195027 |
Statements
An approximation algorithm for computing shortest paths in weighted 3-d domains (English)
0 references
5 August 2013
0 references
shortest path problems
0 references
weighted paths
0 references
weighted 3-d domains
0 references
approximation algorithms
0 references
Voronoi diagrams
0 references
0.8788649439811707
0 references
0.8643305897712708
0 references
0.8627041578292847
0 references
0.8532524108886719
0 references
0.8379092812538147
0 references
