Matroids and integrality gaps for hypergraphic steiner tree relaxations

@article{Goemans2012MatroidsAI,
  title={Matroids and integrality gaps for hypergraphic steiner tree relaxations},
  author={Michel X. Goemans and Neil Olver and Thomas Rothvoss and Rico Zenklusen},
  journal={ArXiv},
  year={2012},
  volume={abs/1111.7280}
}
  • Michel X. Goemans, Neil Olver, +1 author Rico Zenklusen
  • Published 2012
  • Computer Science, Mathematics
  • ArXiv
  • Until recently, LP relaxations have only played a very limited role in the design of approximation algorithms for the Steiner tree problem. In particular, no (efficiently solvable) Steiner tree relaxation was known to have an integrality gap bounded away from 2, before Byrka et al. [3] showed an upper bound of ~1.55 of a hypergraphic LP relaxation and presented a ln(4)+ε ~1.39 approximation based on this relaxation. Interestingly, even though their approach is LP based, they do not compare the… CONTINUE READING

    Figures and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 35 CITATIONS, ESTIMATED 68% COVERAGE

    On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree

    VIEW 17 EXCERPTS
    CITES BACKGROUND & METHODS

    An Efficient Approximation Algorithm for the Steiner Tree Problem

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Steiner Tree 1.39-Approximation in Practice

    VIEW 1 EXCERPT
    CITES METHODS

    Strong Steiner Tree Approximations in Practice

    FILTER CITATIONS BY YEAR

    2012
    2020

    CITATION STATISTICS

    • 6 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES

    On the bidirected cut relaxation for the metric Steiner tree problem

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Tighter Bounds for Graph Steiner Tree Approximation

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    The Steiner tree problem on graphs: Inapproximability results

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    The Steiner Problem with Edge Lengths 1 and 2

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Steiner Minimal Trees

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    An 11/6-approximation algorithm for the network steiner problem

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL