An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
scientific article

    Statements

    An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    minimum spanning tree
    0 references
    Steiner tree
    0 references
    bottleneck length
    0 references
    Yao graph
    0 references

    Identifiers