Inapproximability of b-Matching in k-Uniform Hypergraphs.

El Ouali, Mourad, Fretwurst, Antje and Srivastav, Anand (2011) Inapproximability of b-Matching in k-Uniform Hypergraphs. In: WALCOM: Algorithms and Computation. ; 6552 . Springer, Berlin, Heidelberg, pp. 57-69. DOI 10.1007/978-3-642-19094-0_8.

Full text not available from this repository.

Supplementary data:

Document Type: Book chapter
Research affiliation: Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
DOI etc.: 10.1007/978-3-642-19094-0_8
ISSN: 0302-9743
Projects: Future Ocean
Date Deposited: 29 Mar 2018 10:30
Last Modified: 29 Mar 2018 10:30
URI: http://oceanrep.geomar.de/id/eprint/42530

Actions (login required)

View Item View Item