Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947)

From MaRDI portal
Revision as of 00:26, 29 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6472761
Language Label Description Also known as
English
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
scientific article; zbMATH DE number 6472761

    Statements

    Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (English)
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    approximation algorithms
    0 references
    bounded degree
    0 references
    iterative rounding
    0 references
    spanning trees
    0 references

    Identifiers

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