Degree bounded bottleneck spanning trees in three dimensions (Q2292155)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Degree bounded bottleneck spanning trees in three dimensions
scientific article

    Statements

    Degree bounded bottleneck spanning trees in three dimensions (English)
    0 references
    0 references
    0 references
    3 February 2020
    0 references
    0 references
    minimum spanning trees
    0 references
    bottleneck objective
    0 references
    approximation algorithms
    0 references
    discrete geometry
    0 references
    bounded degree
    0 references
    combinatorial optimisation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references