{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T14:40:30Z","timestamp":1740926430595,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_8","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T06:21:40Z","timestamp":1297318900000},"page":"57-69","source":"Crossref","is-referenced-by-count":1,"title":["Inapproximability of b-Matching in k-Uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"Mourad","family":"El Ouali","sequence":"first","affiliation":[]},{"given":"Antje","family":"Fretwurst","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/rsa.3240060107","volume":"6","author":"J. Aronson","year":"1995","unstructured":"Aronson, J., Dyer, M.E., Frieze, A.M., Suen, S.: Randomized greedy matching II. Random Structures and Algorithms\u00a06(1), 55\u201374 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. Journal of the ACM\u00a045, 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of $\\mathcal{NP}$ . Journal of the ACM\u00a045, 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01303202","volume":"13","author":"Z. F\u00fcredi","year":"1993","unstructured":"F\u00fcredi, Z., Kahn, J., Seymour, P.D.: On the fractional matching polytope of a hypergraph. Combinatorica\u00a013(2), 167\u2013180 (1993)","journal-title":"Combinatorica"},{"key":"#cr-split#-8_CR5.1","doi-asserted-by":"crossref","unstructured":"Gonen, R., Lehmann, D.J.: Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. CoRR cs.GT\/0202032, 13???20 (2002);","DOI":"10.1145\/352871.352873"},{"key":"#cr-split#-8_CR5.2","unstructured":"Presented at ACM Conference on Electronic Commerce (2000)"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015(1), 20\u201339 (2006)","journal-title":"Computational Complexity"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of the systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal Discrete Math.\u00a02, 68\u201372 (1989)","journal-title":"SIAM Journal Discrete Math."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/11549345_53","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Krysta","year":"2005","unstructured":"Krysta, P.: Greedy approximation via duality for packing, combinatorial auctions and routing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 615\u2013627. Springer, Heidelberg (2005)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-14165-2_22","volume-title":"Automata, Languages and Programming","author":"N. Bansal","year":"2010","unstructured":"Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 250\u2013261. Springer, Heidelberg (2010)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"8_CR14","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"V.T. Paschos","year":"1997","unstructured":"Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys\u00a029(2), 171\u2013209 (1997)","journal-title":"ACM Computing Surveys"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics\u00a013, 2\u201324 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<161::AID-RSA1>3.0.CO;2-W","volume":"8","author":"V. R\u00f6dl","year":"1996","unstructured":"R\u00f6dl, V., Thoma, L.: Asymptotic packing and the random greedy algorithm. Random Structures and Algorithms\u00a08(3), 161\u2013177 (1996)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/rsa.3240070206","volume":"7","author":"J. Spencer","year":"1995","unstructured":"Spencer, J.: Asymptotic packing via a branching process. Random Structures and Algorithms\u00a07(2), 167\u2013172 (1995)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1137\/S0097539796314240","volume":"29","author":"A. Srinivasan","year":"1999","unstructured":"Srinivasan, A.: Improved approximation guarantees for packing and covering integer programs. SIAM Journal on Computing\u00a029(2), 648\u2013670 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T","volume":"8","author":"A. Srivastav","year":"1996","unstructured":"Srivastav, A., Stangier, P.: Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures and Algorithms\u00a08(1), 27\u201358 (1996)","journal-title":"Random Structures and Algorithms"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. of the 33rd ACM STOC (2001)","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T13:43:21Z","timestamp":1740923001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}