%0 Conference Paper %1 conf/cocoa/OualiJ12 %A Ouali, Mourad El %A Jäger, Gerold %B COCOA %D 2012 %E Lin, Guohui %I Springer %K dblp %P 200-211 %T The b-Matching Problem in Hypergraphs: Hardness and Approximability. %U http://dblp.uni-trier.de/db/conf/cocoa/cocoa2012.html#OualiJ12 %V 7402 %@ 978-3-642-31769-9

@inproceedings{conf/cocoa/OualiJ12, added-at = {2017-05-17T00:00:00.000+0200}, author = {Ouali, Mourad El and Jäger, Gerold}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2467cbbd62ac6af69c6338fc25485705f/dblp}, booktitle = {COCOA}, crossref = {conf/cocoa/2012}, editor = {Lin, Guohui}, ee = {https://doi.org/10.1007/978-3-642-31770-5_18}, interhash = {fa4ae2814789db9158512017b0cd816d}, intrahash = {467cbbd62ac6af69c6338fc25485705f}, isbn = {978-3-642-31769-9}, keywords = {dblp}, pages = {200-211}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-27T17:25:45.000+0200}, title = {The b-Matching Problem in Hypergraphs: Hardness and Approximability.}, url = {http://dblp.uni-trier.de/db/conf/cocoa/cocoa2012.html#OualiJ12}, volume = 7402, year = 2012 }