{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:00Z","timestamp":1740099600329,"version":"3.37.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_17","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"248-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Effective Heuristics for Matchings in Hypergraphs"],"prefix":"10.1007","author":[{"given":"Fanny","family":"Dufoss\u00e9","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8678-5467","authenticated-orcid":false,"given":"Kamer","family":"Kaya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1081-2411","authenticated-orcid":false,"given":"Ioannis","family":"Panagiotas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4960-3545","authenticated-orcid":false,"given":"Bora","family":"U\u00e7ar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R Aharoni","year":"2000","unstructured":"Aharoni, R., Haxell, P.: Hall\u2019s theorem for hypergraphs. J. Graph Theory 35(2), 83\u201388 (2000)","journal-title":"J. Graph Theory"},{"key":"17_CR2","unstructured":"Anastos, M., Frieze, A.: Finding perfect matchings in random cubic graphs in linear time. arXiv preprint arXiv:1808.00825 (2018)"},{"key":"17_CR3","unstructured":"Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurence optimization. ECCC Report (2003)"},{"key":"17_CR4","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman, Ser. A 5, 147\u2013154 (1946)","journal-title":"Univ. Nac. Tucuman, Ser. A"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka Jr., E.R., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: AAAI, vol. 5, p. 3 (2010)","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"17_CR6","unstructured":"\u00c7ataly\u00fcrek, \u00dc.V., Aykanat, C.: PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0. Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey. https:\/\/www.cc.gatech.edu\/~umit\/software.html (1999)"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/A:1009716300509","volume":"2","author":"E Cohen","year":"1998","unstructured":"Cohen, E.: Structure prediction and computation of sparse matrix products. J. Comb. Optim. 2(4), 307\u2013332 (1998)","journal-title":"J. Comb. Optim."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013518. IEEE (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M.: How to sell hyperedges: the hypermatching assignment problem. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 342\u2013351. SIAM (2013)","DOI":"10.1137\/1.9781611973105.25"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Devlin, P., Kahn, J.: Perfect fractional matchings in $$k$$-out hypergraphs. arXiv preprint arXiv:1703.03513 (2017)","DOI":"10.37236\/6890"},{"key":"17_CR11","unstructured":"Dufoss\u00e9, F., Kaya, K., Panagiotas, I., U\u00e7ar, B.: Scaling matrices and counting perfect matchings in graphs. Technical Report RR-9161, Inria - Research Centre Grenoble - Rh\u00f4ne-Alpes (2018)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2015.06.009","volume":"85","author":"F Dufoss\u00e9","year":"2015","unstructured":"Dufoss\u00e9, F., Kaya, K., U\u00e7ar, B.: Two approximation algorithms for bipartite matching on multicore architectures. J. Parallel Distr. Com. 85, 62\u201378 (2015)","journal-title":"J. Parallel Distr. Com."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/1.9781611975215.6","volume-title":"2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing","author":"Fanny Dufoss\u00e9","year":"2018","unstructured":"Dufoss\u00e9, F., Kaya, K., Panagiotas, I., U\u00e7ar, B.: Approximation algorithms for maximum matchings in undirected graphs. In: Proceedings Seventh SIAM Workshop on Combinatorial Scientific Computing, pp. 56\u201365. SIAM, Bergen (2018)"},{"key":"17_CR14","unstructured":"Dufoss\u00e9, F., Kaya, K., Panagiotas, I., U\u00e7ar, B.: Effective heuristics for matchings in hypergraphs. Research Report RR-9224, Inria Grenoble Rh\u00f4ne-Alpes, November 2018. https:\/\/hal.archives-ouvertes.fr\/hal-01924180"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/rsa.3240020104","volume":"2","author":"M Dyer","year":"1991","unstructured":"Dyer, M., Frieze, A.: Randomized greedy matching. Random Struct. Algorithms 2(1), 29\u201345 (1991)","journal-title":"Random Struct. Algorithms"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/0024-3795(89)90490-4","volume":"114","author":"J Franklin","year":"1989","unstructured":"Franklin, J., Lorenz, J.: On the scaling of multidimensional matrices. Linear Algebra Appl. 114, 717\u2013735 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0095-8956(86)90077-8","volume":"40","author":"AM Frieze","year":"1986","unstructured":"Frieze, A.M.: Maximum matchings in a class of random graphs. J. Comb. Theory B 40(2), 196\u2013212 (1986)","journal-title":"J. Comb. Theory B"},{"key":"17_CR18","unstructured":"Froger, A., Guyon, O., Pinson, E.: A set packing approach for scheduling passenger train drivers: the French experience. In: RailTokyo2015. Tokyo, Japan, March 2015. https:\/\/hal.archives-ouvertes.fr\/hal-01138067"},{"key":"17_CR19","first-page":"2265","volume":"8","author":"A Globerson","year":"2007","unstructured":"Globerson, A., Chechik, G., Pereira, F., Tishby, N.: Euclidean embedding of co-occurrence data. J. Mach. Learn. Res. 8, 2265\u20132295 (2007)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2508028.2505987","volume":"60","author":"G Gottlob","year":"2013","unstructured":"Gottlob, G., Greco, G.: Decomposing combinatorial auctions and set packing problems. J. ACM 60(4), 24:1\u201324:39 (2013)","journal-title":"J. ACM"},{"key":"17_CR21","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: SODA, vol. 95, pp. 160\u2013169 (1995)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-45198-3_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E Hazan","year":"2003","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-dimensional matching. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) APPROX\/RANDOM -2003. LNCS, vol. 2764, pp. 83\u201397. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45198-3_8"},{"issue":"1","key":"17_CR23","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. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: 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 J. Discrete Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0095-8956(03)00024-8","volume":"88","author":"M Karo\u0144ski","year":"2003","unstructured":"Karo\u0144ski, M., Pittel, B.: Existence of a perfect matching in a random ($$1+e^{-1}$$)-out bipartite graph. J. Comb. Theory B 88(1), 1\u201316 (2003)","journal-title":"J. Comb. Theory B"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Sipser, M.: Maximum matching in sparse random graphs. In: FOCS 1981, Nashville, TN, USA, pp. 364\u2013375 (1981)","DOI":"10.1109\/SFCS.1981.21"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Kaya, O., U\u00e7ar, B.: Scalable sparse tensor decompositions in distributed memory systems. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. SC 2015, pp. 77:1\u201377:11. ACM, Austin (2015)","DOI":"10.1145\/2807591.2807624"},{"key":"17_CR29","unstructured":"Lamm, S., Sanders, P., Schulz, C., Strash, D., Werneck, R.F.: Finding Near-Optimal Independent Sets at Scale. In: Proceedings of the 16th Meeting on Algorithm Engineering and Exerpimentation (ALENEX\u201916) (2016)"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Fan, C.J.: Computing the block triangular form of a sparse matrix. ACM T. Math. Software 16, 303\u2013324 (1990)","journal-title":"ACM T. Math. Software"},{"key":"17_CR31","unstructured":"Shetty, J., Adibi, J.: The enron email dataset database schema and brief statistical report. Information sciences institute technical report, University of Southern California 4 (2004)"},{"key":"17_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pacific J. Math. 21, 343\u2013348 (1967)","journal-title":"Pacific J. Math."},{"key":"17_CR33","unstructured":"Smith, S., et al.: FROSTT: the formidable repository of open sparse tensors and tools (2017). http:\/\/frostt.io\/"},{"issue":"1","key":"17_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","volume":"31","author":"DW Walkup","year":"1980","unstructured":"Walkup, D.W.: Matchings in random regular bipartite digraphs. Discrete Math. 31(1), 59\u201364 (1980)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T01:42:12Z","timestamp":1664934132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}