Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (Q5317173)

From MaRDI portal
Revision as of 22:36, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 2205869
Language Label Description Also known as
English
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
scientific article; zbMATH DE number 2205869

    Statements

    Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds (English)
    0 references
    0 references
    0 references
    16 September 2005
    0 references
    approximation algorithms
    0 references
    network algorithms
    0 references
    bicriteria approximation
    0 references
    spanning trees
    0 references
    degree-bounded spanning trees
    0 references
    Lagrangian relaxation
    0 references

    Identifiers

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