An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-013-9486-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1798872925 / rank | |||
Normal rank | |||
Revision as of 21:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for computing shortest paths in weighted 3-d domains |
scientific article |
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
