An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dcg/AleksandrovDMS13, #quickstatements; #temporary_batch_1731547958265 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcg/AleksandrovDMS13 / rank | |||
Normal rank | |||
Revision as of 03:59, 14 November 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
