{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T14:05:22Z","timestamp":1784383522636,"version":"3.55.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_15","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:48Z","timestamp":1752796128000},"page":"201-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation for\u00a0Unpopularity in\u00a0(3,\u00a03)-Hypergraph Matching with\u00a0One-Sided Preferences"],"prefix":"10.1007","author":[{"given":"Yashdeep","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sushanta","family":"Karmakar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37(4), 1030\u20131045 (2007)","journal-title":"SIAM J. Comput."},{"key":"15_CR2","unstructured":"Cseh, \u00c1.: Popular matchings. Trends Comput. Soc. Choice, 105(3) (2017)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Peters, J.: Three-dimensional popular matching with cyclic preferences. AAMAS, 309\u2013317 (2022)","DOI":"10.65109\/LGJG3306"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Syst. Res. 20, 166\u2013173 (1975)","journal-title":"Syst. Res."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Gupta, S., Misra, P., Saurabh, S., Zehavi, M.: Popular matching in roommates setting is NP-hard. ACM Trans. Comput. Theory 13(2) (2021). Article 9","DOI":"10.1145\/3442354"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{2.5}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","DOI":"10.1137\/0202019"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ic.2012.10.012","volume":"222","author":"CC Huang","year":"2013","unstructured":"Huang, C.C., Kavitha, T.: Popular matchings in the stable marriage problem. Inf. Comput. 222, 180\u201394 (2013)","journal-title":"Inf. Comput."},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/110852838","volume":"27","author":"CC Huang","year":"2013","unstructured":"Huang, C.C., Kavitha, T.: Near-popular matchings in the roommates problem. SIAM J. Discret. Math. 27(1), 43\u201362 (2013)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/s00453-010-9434-9","volume":"61","author":"CC Huang","year":"2011","unstructured":"Huang, C.C., Kavitha, T., Michail, D., Nasre, M.: Bounded unpopularity matchings. Algorithmica 61(3), 738\u2013757 (2011)","journal-title":"Algorithmica"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Kavitha, T.: Popular matchings of desired size. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 306\u2013317 (2018)","DOI":"10.1007\/978-3-030-00256-5_25"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Kavitha, T.: Stable matchings, one-sided ties, and approximate popularity. Algorithmica, 1\u201333 (2024)","DOI":"10.1007\/s00453-024-01215-6"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. In: International Colloquium on Automata, Languages, and Programming, pp. 574\u2013584 (2009)","DOI":"10.1007\/978-3-642-02927-1_48"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Latin American Symposium on Theoretical Informatics, pp. 593\u2013604. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78773-0_51"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10878-009-9287-9","volume":"22","author":"E McDermid","year":"2008","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: structure and algorithms. J. Comb. Optim. 22(3), 339\u201358 (2008)","journal-title":"J. Comb. Optim."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Singh, Y., Karmakar, S.: The popular matching problem in a (3,3)-hypergraph with one-sided preferences. In: 2023 Eleventh International Symposium on Computing and Networking Workshops (CANDARW), pp. 121\u2013127. IEEE (2023)","DOI":"10.1109\/CANDARW60564.2023.00028"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Singh, Y., Karmakar, S.: Bounded unpopularity matching in a (3, 3)-hypergraph with one-sided preferences. In: 2024 Twelfth International Symposium on Computing and Networking Workshops (CANDARW), pp. 204\u2013210. IEEE (2024)","DOI":"10.1109\/CANDARW64572.2024.00040"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T13:58:16Z","timestamp":1784383096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}