Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphic LP Relaxations for Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395337 / rank
 
Normal rank

Revision as of 13:56, 3 July 2024

scientific article
Language Label Description Also known as
English
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
scientific article

    Statements

    Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (English)
    0 references
    0 references
    23 December 2010
    0 references
    hypergraph
    0 references
    integrality gap
    0 references
    randomized algorithm
    0 references
    Steiner tree
    0 references

    Identifiers

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