Hypergraphic LP Relaxations for Steiner Trees (Q3569832)

From MaRDI portal
Revision as of 10:16, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5300508)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6181927
Language Label Description Also known as
English
Hypergraphic LP Relaxations for Steiner Trees
scientific article; zbMATH DE number 6181927

    Statements

    Hypergraphic LP Relaxations for Steiner Trees (English)
    0 references
    0 references
    0 references
    22 June 2010
    0 references
    27 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree problem
    0 references
    network design
    0 references
    linear programming
    0 references
    approximation algorithm
    0 references
    integrality gaps
    0 references
    hypergraphs
    0 references
    uncrossing method
    0 references