An Approximation Result for Matchings in Partitioned Hypergraphs

Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

We investigate the matching and perfect matching polytopes of hypergraphs having a special structure, which we call partitioned hypergraphs. We show that the integrality gap of the standard LP-relaxation is at most \(2\sqrt{d}\) for partitioned hypergraphs with parts of size \(\le d\). Furthermore, we show that this bound cannot be improved to \(\mathscr {O}(d^{0.5-\varepsilon })\).

References

  1. 1.
    Beckenbach, I.: Special cases of the hypergraph assignment problem. Master Thesis, TU Berlin (2013)Google Scholar
  2. 2.
    Berge, C.: Sur certains hypergraphes généralisant les graphes bipartites. In: Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfred, 1969), pp. 119–133. North-Holland, Amsterdam (1970)Google Scholar
  3. 3.
    Borndörfer, R., Heismann, O.: The Hypergraph Assignment Problem. Technical Report, Zuse Institut, Berlin (2012)Google Scholar
  4. 4.
    Chan, Y., Lau, L.: On linear and semidefinite programming relaxations for hypergraph matching. Math. Prog. 135(1–2), 123–148 (2012)CrossRefGoogle Scholar
  5. 5.
    Füredi, Z., Kahn, J., Seymour, P.D.: On the fractional matching polytope of a hypergraph. Combinatorica 13(2), 167–180 (1993)CrossRefGoogle Scholar
  6. 6.
    Halldórsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Lect. Notes Comput. Sci. 1627, 261–270 (1999)CrossRefGoogle Scholar
  7. 7.
    Halldórsson, M.M., Kratochvíl, J., Telle, J.A.: Independent sets with domination constraints. Discret. Appl. Math. 99, 39–54 (2000)CrossRefGoogle Scholar
  8. 8.
    Hazan, E., Safra, M., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20–29 (2006)CrossRefGoogle Scholar
  9. 9.
    Heismann, O.: The Hypergraph Assignment Problem. Ph.D. Thesis, TU Berlin (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Zuse Institut BerlinBerlinGermany

Personalised recommendations