The Euclidean bottleneck full Steiner tree problem (Q2258077)

From MaRDI portal
Revision as of 00:38, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The Euclidean bottleneck full Steiner tree problem
scientific article

    Statements

    The Euclidean bottleneck full Steiner tree problem (English)
    0 references
    0 references
    2 March 2015
    0 references
    geometric optimization
    0 references
    Steiner trees
    0 references
    bottleneck full Steiner tree problem
    0 references
    NP-hard
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references