{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:18:22Z","timestamp":1773937102808,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","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-75409-8_21","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:32Z","timestamp":1737497432000},"page":"297-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Popular Solutions for\u00a0Optimal Matchings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2619-6606","authenticated-orcid":false,"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"5","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.1287\/opre.2020.2093","volume":"69","author":"N Ahani","year":"2021","unstructured":"Ahani, N., Andersson, T., Martinello, A., Trapp, A., Teytelboym, A.: Placement optimization in refugee resettlement. Oper. Res. 69(5), 1468\u20131486 (2021)","journal-title":"Oper. Res."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.tcs.2010.02.003","volume":"411","author":"P Biro","year":"2010","unstructured":"Biro, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoret. Comput. Sci. 411, 1828\u20131841 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR3","unstructured":"Cseh, A.: Popular matchings. In: Endriss, U. (ed.) Trends in Computational Social Choice (2017)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"AL Dulmage","year":"1958","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Can. J. Math. 10, 517\u2013534 (1958)","journal-title":"Can. J. Math."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/moor.2021.1139","volume":"47","author":"Y Faenza","year":"2022","unstructured":"Faenza, Y., Kavitha, T.: Quasi-popular matchings, optimality, and extended formulations. Math. Oper. Res. 47(1), 427\u2013457 (2022)","journal-title":"Math. Oper. Res."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Kavitha, T., Powers, V., Zhang, X.: Popular matchings and limits to tractability. In: Proceedings of the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 2790\u20132809 (2019)","DOI":"10.1137\/1.9781611975482.173"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Amer. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discret. Appl. Math. 11, 223\u2013232 (1985)","journal-title":"Discret. Appl. Math."},{"key":"21_CR9","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. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"key":"21_CR10","unstructured":"Goemans, M.: Combinatorial optimization (2017). https:\/\/math.mit.edu\/~goemans\/18453S17\/18453.html"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/120902562","volume":"43","author":"T Kavitha","year":"2014","unstructured":"Kavitha, T.: A size-popularity tradeoff in the stable marriage problem. SIAM J. Comput. 43(1), 52\u201371 (2014)","journal-title":"SIAM J. Comput."},{"key":"21_CR12","unstructured":"Kavitha, T.: Matchings, critical nodes, and popular solutions. In: Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 25:1\u201325:19 (2021)"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1137\/22M1523248","volume":"38","author":"T Kavitha","year":"2024","unstructured":"Kavitha, T.: Maximum matchings and popularity. SIAM J. Discr. Math. 38(2), 1202\u20131221 (2024). https:\/\/doi.org\/10.1137\/22M1523248","journal-title":"SIAM J. Discr. Math."},{"key":"21_CR14","unstructured":"Los\u00e1sz, L., Plummer, M.D.: Matching Theory. Mathematics Studies, vol. 121. North-Holland (1986)"},{"key":"21_CR15","unstructured":"Nasre, M., Nimbhorkar, P., Ranjan, K., Sarkar, A.: Popular matchings in the hospital-residents problem with two-sided lower quotas. In: Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 30:1\u201330:21 (2021)"},{"key":"21_CR16","unstructured":"Pulleyblank, W.R.: Chapter 3, matchings and extensions. In: Graham, R.L., Gr\u00f6tschel, M., Lovasz, L. (ed.) The Handbook of Combinatorics (1995)"},{"key":"21_CR17","unstructured":"Robards, P.A.: Applying the two-sided matching processes to the United States Navy enlisted assignment process. Master\u2019s thesis, Naval Postgraduate School, Monterey, Canada (2001)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01586041","volume":"54","author":"UG Rothblum","year":"1992","unstructured":"Rothblum, U.G.: Characterization of stable matchings as extreme points of a polytope. Math. Program. 54, 57\u201367 (1992)","journal-title":"Math. Program."},{"key":"21_CR19","unstructured":"Soldner, M.: Optimization and measurement in humanitarian operations: addressing practical needs. Ph.D. thesis, Georgia Institute of Technology (2014)"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"CP Teo","year":"1998","unstructured":"Teo, C.P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23(4), 874\u2013891 (1998)","journal-title":"Math. Oper. Res."},{"key":"21_CR21","unstructured":"Yang, W., Giampapa, J.A., Sycara, K.: Two-sided matching for the US Navy detailing process with market complication. Technical report CMU-R1-TR-03-49, Robotics Institute, Carnegie Mellon University (2003)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:36Z","timestamp":1737497436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_21","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":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}