Abstract
AbstractIn this paper we analyze the maximum cardinality b-matching problem in l-uniform hypergraphs with respect to the complexity class Max-Snp, where b-matching is defined as follows: for given b ∈ ℕ and a hypergraph \(\mathcal{H}=(V,\mathcal{E})\) a subset \(M_{b}\subseteq \mathcal{E}\) with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of M b . We show that if the maximum degree of the vertices is bounded by a constant B ∈ ℕ , this problem has no approximation scheme, unless \(\mathcal{P}=\mathcal{NP}\). This result generalizes a result of Kann from b = 1 to the case that b ∈ ℕ with \( 0 < b\leq \frac{B}{3}\). Furthermore, we extend a result of Srivastav and Stangier, who gave an approximation algorithm for the unweighted b-matching problem.KeywordsHypergraphsmatching L-reductionBoolean satisfiabilityrandomized rounding Max-Snp-hardness
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
