An approximation result for matchings in partitioned hypergraphs

DOI10.1007/978-3-319-28697-6_5MaRDI QIDQ2806888zbMATH OpenOpenAlexFDO

Authors Isabel Beckenbach, Ralf Borndörfer

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)

Recommendations

• scientific article; zbMATH DE number 6297805
• On linear and semidefinite programming relaxations for hypergraph matching
• Matchings in hypergraphs of large minimum degree
• Inapproximability of b-matching in k-uniform hypergraphs
• Computing the partition function for perfect matchings in a hypergraph

Cites work

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

Cited in

(3)

• A note on formulations for the A-partition problem on hypergraphs
• scientific article; zbMATH DE number 2079358 (Why is no real title available?)
• On linear and semidefinite programming relaxations for hypergraph matching

This page was built for publication: An approximation result for matchings in partitioned hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806888)