Inapproximability of $b$-Matching in $k$-uniform Hypergraphs

Research Area: Engineering of Approximation Algorithms for Matching and Covering in Hypergraphs and Large Graphs Year: 2011
Type of Publication: In Proceedings
Authors: Mourad El Ouali; Antje Fretwurst; Anand Srivastav
Book title: Proceedings of the 5th International Workshop on Algorithms and Computation, New Delhi, India, February 2011 (WALCOM 2011)
Pages: 57-69
BibTex:
[Bibtex]
[ Back ]