{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:54:55Z","timestamp":1769925295898,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T00:00:00Z","timestamp":1512777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00493-017-3567-2","type":"journal-article","created":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T03:37:35Z","timestamp":1512790655000},"page":"1285-1307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Finding Perfect Matchings in Bipartite Hypergraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Chidambaram","family":"Annamalai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"key":"3567_CR1","first-page":"1200","volume":"119","author":"N. Alon","year":"2012","unstructured":"N. Alon, P. Frankl, H. Huang, V. R\u00f6dl, A. Ruci\u0144ski and B. Sudakov: Large matchings in uniform hypergraphs and the conjectures of Erd\u0151s and Samuels, Journal of Combinatorial Theory, Series A 119 (2012), 1200\u20131215.","journal-title":"Series A"},{"key":"3567_CR2","first-page":"24","volume":"8","author":"A. Asadpour","year":"2012","unstructured":"A. Asadpour, U. Feige and A. Saberi: Santa claus meets hypergraph matchings, ACM Transactions on Algorithms (TALG) 8 (2012), 24.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"3567_CR3","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1137\/1.9781611973730.90","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"C. Annamalai","year":"2015","unstructured":"C. Annamalai, C. Kalaitzis and O. Svensson: Combinatorial algorithm for re-stricted max-min fair allocation, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1357\u20131372, 2015."},{"key":"3567_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1132516.1132522","volume-title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing","author":"N. Bansal","year":"2006","unstructured":"N. Bansal and M. Sviridenko: The santa claus problem, in: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, 31\u201340. ACM, 2006."},{"key":"3567_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01261318","volume":"16","author":"M. Conforti","year":"1996","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor and K. Vu\u0151kovi\u010d: Perfect matchings in balanced hypergraphs, Combinatorica 16 (1996), 325\u2013329.","journal-title":"Combinatorica"},{"key":"3567_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/1.9781611973105.25","volume-title":"Proceedings of the Twenty-Fourth Annual ACMSIAM Symposium on Discrete Algorithms","author":"M. Cygan","year":"2013","unstructured":"M. Cygan, F. Grandoni and M. Mastrolilli: How to sell hyperedges: The hypermatching assignment problem, in: Proceedings of the Twenty-Fourth Annual ACMSIAM Symposium on Discrete Algorithms, 342\u2013351. SIAM, 2013."},{"key":"3567_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-011-0451-5","volume":"135","author":"Y. H. Chan","year":"2012","unstructured":"Y. H. Chan and L. C. Lau: On linear and semidefinite programming relaxations for hypergraph matching, Mathematical Programming 135 (2012), 123\u2013148.","journal-title":"Mathematical Programming"},{"key":"3567_CR8","first-page":"509","volume-title":"Proceedings of the Fifty-Fourth Annual Symposium on Foundations of Computer Science","author":"M. Cygan","year":"2013","unstructured":"M. Cygan: Improved approximation for 3-dimensional matching via bounded pathwidth local search, in: Proceedings of the Fifty-Fourth Annual Symposium on Foundations of Computer Science, 509\u2013518. IEEE, 2013."},{"key":"3567_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"3","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems on abstract graphs, Proceedings of the London Mathematical Society 3 (1952), 69\u201381.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"3567_CR10","first-page":"287","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"U. Feige","year":"2008","unstructured":"U. Feige: On allocations that maximize fairness, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 287\u2013293. Society for Industrial and Applied Mathematics, 2008."},{"key":"3567_CR11","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-319-09174-7_35","volume-title":"Combinatorial Optimization","author":"M. F\u00fcrer","year":"2014","unstructured":"M. F\u00fcrer and H. Yu: Approximating the k-set packing problem by local improvements, in: Combinatorial Optimization, 408\u2013420. Springer, 2014."},{"key":"3567_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall: On representatives of subsets, J. London Math. Soc 10 (1935), 26\u201330.","journal-title":"J. London Math. Soc"},{"key":"3567_CR13","first-page":"160","volume-title":"Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"M. M. Halld\u00f3rsson","year":"1995","unstructured":"M. M. Halld\u00f3rsson: Approximating discrete collections via local improvements, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, volume 95, 160\u2013169. SIAM, 1995."},{"key":"3567_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell: A condition for matchability in hypergraphs, Graphs and Combinatorics 11 (1995), 245\u2013248.","journal-title":"Graphs and Combinatorics"},{"key":"3567_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp: An n5=2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2 (1973), 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"3567_CR16","first-page":"75","volume":"17","author":"G. H. Hardy","year":"1918","unstructured":"G. H. Hardy and S. Ramanujan: Asymptotic formula in combinatory analysis, Proceedings of the London Mathematical Society, s2 17 (1918), 75.","journal-title":"s2"},{"key":"3567_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. A. J. Hurkens","year":"1989","unstructured":"C. A. J. Hurkens and A. Schrijver: On the size of 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 on Discrete Mathematics 2 (1989), 68\u201372.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3567_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/2049697.2049702","volume":"58","author":"B. Haeupler","year":"2011","unstructured":"B. Haeupler, B. Saha and A. Srinivasan: New constructive aspects of the lovasz local lemma, Journal of the ACM (JACM) 58 (2011), 28.","journal-title":"Journal of the ACM (JACM)"},{"key":"3567_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp: Reducibility among combinatorial problems, Springer, 1972."},{"key":"3567_CR20","first-page":"81","volume":"5","author":"A. V. Karzanov","year":"1973","unstructured":"A. V. Karzanov: O nakhozhdenii maksimal\u2019nogo potoka v setyakh spetsial\u2019nogo vida i nekotorykh prilozheniyakh, Matematicheskie Voprosy Upravleniya Proizvodstvom 5 (1973), 81.","journal-title":"Matematicheskie Voprosy Upravleniya Proizvodstvom"},{"key":"3567_CR21","first-page":"565","volume-title":"On determinants, matchings, and random algorithms","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On determinants, matchings, and random algorithms, in: FCT, volume 79, 565\u2013574, 1979."},{"key":"3567_CR22","first-page":"253","volume-title":"Proceedings of the Fifty-Fourth Annual Symposium on Foundations of Computer Science","author":"A. Madry","year":"2013","unstructured":"A. Madry: Navigating central path with electrical flows: From ows to matchings, and back, in: Proceedings of the Fifty-Fourth Annual Symposium on Foundations of Computer Science, 253\u2013262. IEEE, 2013."},{"key":"3567_CR23","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/FOCS.2004.40","volume-title":"Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science","author":"M. Mucha","year":"2004","unstructured":"M. Mucha and P. Sankowski: Maximum matchings via gaussian elimination, in: Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, 248\u2013255. IEEE, 2004."},{"key":"3567_CR24","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-642-31594-7_61","volume-title":"Automata, Languages, and Programming","author":"L. Polacek","year":"2012","unstructured":"L. Polacek and O. Svensson: Quasi-polynomial local search for restricted maxmin fair allocation, in: Automata, Languages, and Programming, 726\u2013737. Springer, 2012."},{"key":"3567_CR25","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-15369-3_28","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Singh","year":"2010","unstructured":"M. Singh and K. Talwar: Improving integrality gaps via Chv\u00e1tal-Gomory rounding, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 366\u2013379. Springer, 2010."},{"key":"3567_CR26","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/110851201","volume":"41","author":"O. Svensson","year":"2012","unstructured":"O. Svensson: Santa Claus schedules jobs on unrelated machines, SIAM Journal on Computing 41 (2012), 1318\u20131341.","journal-title":"SIAM Journal on Computing"},{"key":"3567_CR27","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-642-39206-1_67","volume-title":"Automata, Languages, and sProgramming","author":"M. Sviridenko","year":"2013","unstructured":"M. Sviridenko and J. Ward: Large neighborhood local search for the maximum set packing problem, in: Automata, Languages, and sProgramming, 792\u2013803. Springer, 2013."},{"key":"3567_CR28","volume-title":"Introduction to graph theory","author":"D. B. West","year":"2001","unstructured":"D. B. West: Introduction to graph theory, volume 2, Prentice hall Upper Saddle River, 2001."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3567-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3567-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3567-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T03:57:15Z","timestamp":1660103835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3567-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,9]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["3567"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3567-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,9]]},"assertion":[{"value":"18 January 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}