Querying Approximate Shortest Paths in Anisotropic Regions (Q3053153)
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: Querying Approximate Shortest Paths in Anisotropic Regions |
scientific article; zbMATH DE number 5810171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Querying Approximate Shortest Paths in Anisotropic Regions |
scientific article; zbMATH DE number 5810171 |
Statements
Querying Approximate Shortest Paths in Anisotropic Regions (English)
0 references
4 November 2010
0 references
shortest path
0 references
anisotropic regions
0 references
convex distance functions
0 references
approximation algorithms
0 references
0.9999998
0 references
0.95768607
0 references
0.95768607
0 references
0.8980953
0 references
0.8968608
0 references
0.88719285
0 references
0.8870375
0 references
0.8787769
0 references
