{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:38:48Z","timestamp":1725849528848},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286952"},{"type":"electronic","value":"9783319286976"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-28697-6_5","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T01:10:47Z","timestamp":1455930647000},"page":"31-36","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Result for Matchings in Partitioned Hypergraphs"],"prefix":"10.1007","author":[{"given":"Isabel","family":"Beckenbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"key":"5_CR1","unstructured":"Beckenbach, I.: Special cases of the hypergraph assignment problem. Master Thesis, TU Berlin (2013)"},{"key":"5_CR2","unstructured":"Berge, C.: Sur certains hypergraphes g\u00e9n\u00e9ralisant les graphes bipartites. In: Combinatorial Theory and its Applications, I (Proc. Colloq., Balatonfred, 1969), pp. 119\u2013133. North-Holland, Amsterdam (1970)"},{"key":"5_CR3","unstructured":"Bornd\u00f6rfer, R., Heismann, O.: The Hypergraph Assignment Problem. Technical Report, Zuse Institut, Berlin (2012)"},{"issue":"1\u20132","key":"5_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-011-0451-5","volume":"135","author":"Y Chan","year":"2012","unstructured":"Chan, Y., Lau, L.: On linear and semidefinite programming relaxations for hypergraph matching. Math. Prog. 135(1\u20132), 123\u2013148 (2012)","journal-title":"Math. Prog."},{"issue":"2","key":"5_CR5","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 13(2), 167\u2013180 (1993)","journal-title":"Combinatorica"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-48686-0_26","volume":"1627","author":"MM Halld\u00f3rsson","year":"1999","unstructured":"Halld\u00f3rsson, M.M.: Approximations of weighted independent set and hereditary subset problems. Lect. Notes Comput. Sci. 1627, 261\u2013270 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00124-9","volume":"99","author":"MM Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson, M.M., Kratochv\u00edl, J., Telle, J.A.: Independent sets with domination constraints. Discret. Appl. Math. 99, 39\u201354 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"5_CR8","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, M., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20\u201329 (2006)","journal-title":"Comput. Complex."},{"key":"5_CR9","unstructured":"Heismann, O.: The Hypergraph Assignment Problem. Ph.D. Thesis, TU Berlin (2014)"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28697-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:50:21Z","timestamp":1559386221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28697-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286952","9783319286976"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28697-6_5","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2016]]}}}