An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62037428, #quickstatements; #temporary_batch_1707149277123 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BUSHWHACK / rank | |||
Normal rank | |||
Revision as of 20:04, 29 February 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
