Approximating spanning trees with few branches (Q2344216)

From MaRDI portal
Revision as of 02:29, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating spanning trees with few branches
scientific article

    Statements

    Approximating spanning trees with few branches (English)
    0 references
    0 references
    0 references
    12 May 2015
    0 references
    theory of computation
    0 references
    design and analysis of algorithms
    0 references
    approximation algorithms analysis
    0 references
    routing and network design problems
    0 references

    Identifiers

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