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 })\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beckenbach, I.: Special cases of the hypergraph assignment problem. Master Thesis, TU Berlin (2013)
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)
Borndörfer, R., Heismann, O.: The Hypergraph Assignment Problem. Technical Report, Zuse Institut, Berlin (2012)
Chan, Y., Lau, L.: On linear and semidefinite programming relaxations for hypergraph matching. Math. Prog. 135(1–2), 123–148 (2012)
Füredi, Z., Kahn, J., Seymour, P.D.: On the fractional matching polytope of a hypergraph. Combinatorica 13(2), 167–180 (1993)
Halldórsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Lect. Notes Comput. Sci. 1627, 261–270 (1999)
Halldórsson, M.M., KratochvÃl, J., Telle, J.A.: Independent sets with domination constraints. Discret. Appl. Math. 99, 39–54 (2000)
Hazan, E., Safra, M., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20–29 (2006)
Heismann, O.: The Hypergraph Assignment Problem. Ph.D. Thesis, TU Berlin (2014)
Acknowledgments
The first author was supported by BMBF Research Campus MODAL.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Beckenbach, I., Borndörfer, R. (2016). An Approximation Result for Matchings in Partitioned Hypergraphs. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-28697-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28695-2
Online ISBN: 978-3-319-28697-6
eBook Packages: Business and ManagementBusiness and Management (R0)