The $b$-matching problem in hypergraphs: hardness and approximability. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 200-211 (2012).
1
Inapproximability of $b$-matching in $k$-uniform hypergraphs. (English)
Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 57-69 (2011).
2
Inapproximability of $b$-matching in $k$-uniform hypergraphs (English)
WALCOM, 57-69 (2011).
3
Start
Contact
Print
General Help
