An Approximation Result for Matchings in Partitioned Hypergraphs

DOI10.1007/978-3-319-28697-6_5zbMath1336.05095OpenAlexW2272079108MaRDI QIDQ2806888

Ralf Borndörfer, Isabel Beckenbach

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_5

zbMATH Keywords

perfect matching polytopes of hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the fractional matching polytope of a hypergraph
• On linear and semidefinite programming relaxations for hypergraph matching
• Independent sets with domination constraints
• On the complexity of approximating \(k\)-set packing

This page was built for publication: An Approximation Result for Matchings in Partitioned Hypergraphs