An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841)

From MaRDI portal
Revision as of 18:58, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    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

    Identifiers