{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T14:16:29Z","timestamp":1768486589905,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T00:00:00Z","timestamp":1345507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10878-012-9537-0","type":"journal-article","created":{"date-parts":[[2012,8,20]],"date-time":"2012-08-20T18:36:46Z","timestamp":1345487806000},"page":"574-596","source":"Crossref","is-referenced-by-count":9,"title":["Popularity at minimum cost"],"prefix":"10.1007","volume":"27","author":[{"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meghana","family":"Nasre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prajakta","family":"Nimbhorkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,21]]},"reference":[{"key":"9537_CR1","first-page":"3","volume-title":"Proceedings of 15th annual international symposium on algorithms and computation","author":"DJ Abraham","year":"2004","unstructured":"Abraham DJ, Cechl\u00e1rov\u00e1 K, Manlove DF, Mehlhorn K (2004) Pareto-optimality in house allocation problems. In: Proceedings of 15th annual international symposium on algorithms and computation, pp\u00a03\u201315"},{"issue":"4","key":"9537_CR2","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"DJ Abraham","year":"2007","unstructured":"Abraham DJ, Irving RW, Kavitha T, Mehlhorn K (2007) Popular matchings. SIAM J Comput 37(4):1030\u20131045","journal-title":"SIAM J Comput"},{"key":"9537_CR3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors P (1975) Match making: assignments based on bilateral preferences. Behav Sci 20:166\u2013173","journal-title":"Behav Sci"},{"issue":"4","key":"9537_CR4","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"RW Irving","year":"2006","unstructured":"Irving RW, Kavitha T, Mehlhorn K, Michail D, Paluch K (2006) Rank-maximal matchings. ACM Trans Algorithms 2(4):602\u2013610","journal-title":"ACM Trans Algorithms"},{"issue":"14","key":"9537_CR5","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1016\/j.dam.2009.06.004","volume":"157","author":"T Kavitha","year":"2009","unstructured":"Kavitha T, Nasre M (2009) Note: optimal popular matchings. Discrete Appl Math 157(14):3181\u20133186","journal-title":"Discrete Appl Math"},{"issue":"12\u201314","key":"9537_CR6","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1016\/j.tcs.2010.12.067","volume":"412","author":"T Kavitha","year":"2011","unstructured":"Kavitha T, Nasre M (2011) Popular matchings with variable item copies. Theor Comput Sci 412(12\u201314):1263\u20131274","journal-title":"Theor Comput Sci"},{"key":"9537_CR7","first-page":"145","volume-title":"Proceedings of 21st annual international symposium on algorithms and computation","author":"T Kavitha","year":"2010","unstructured":"Kavitha T, Nasre M, Nimbhorkar P (2010) Popularity at minimum cost. In: Proceedings of 21st annual international symposium on algorithms and computation, pp 145\u2013156"},{"issue":"24","key":"9537_CR8","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1016\/j.tcs.2010.03.028","volume":"412","author":"T Kavitha","year":"2011","unstructured":"Kavitha T, Mestre J, Nasre M (2011) Popular mixed matchings. Theor Comput Sci 412(24):2679\u20132690","journal-title":"Theor Comput Sci"},{"key":"9537_CR9","first-page":"238","volume-title":"Proceedings of the 8th ACM conference on electronic commerce","author":"M Mahdian","year":"2006","unstructured":"Mahdian M (2006) Random popular matchings. In: Proceedings of the 8th ACM conference on electronic commerce, pp 238\u2013242"},{"key":"9537_CR10","first-page":"492","volume-title":"Proceedings of the 14th annual European symposium on algorithms","author":"D Manlove","year":"2006","unstructured":"Manlove D, Sng C (2006) Popular matchings in the capacitated house allocation problem. In: Proceedings of the 14th annual European symposium on algorithms, pp 492\u2013503"},{"key":"9537_CR11","first-page":"593","volume-title":"Proceedings of the 15th Latin American symposium on theoretical informatics","author":"RM McCutchen","year":"2008","unstructured":"McCutchen RM (2008) The least unpopularity factor and least unpopularity margin criteria for matching problems with one-sided preferences. In: Proceedings of the 15th Latin American symposium on theoretical informatics, pp 593\u2013604"},{"issue":"3","key":"9537_CR12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10878-009-9287-9","volume":"22","author":"E McDermid","year":"2011","unstructured":"McDermid E, Irving RW (2011) Popular matchings: structure and algorithms. J Comb Optim 22(3):339\u2013358","journal-title":"J Comb Optim"},{"key":"9537_CR13","volume-title":"Encyclopedia of algorithms","author":"J Mestre","year":"2008","unstructured":"Mestre J (2008) Weighted popular matchings. In: Kao M-Y (ed) Encyclopedia of algorithms. Springer, Berlin"},{"key":"9537_CR14","first-page":"179","volume-title":"Handbook of combinatorics (vol.\u00a01)","author":"WR Pulleyblank","year":"1995","unstructured":"Pulleyblank WR (1995) Matchings and extensions. In: Handbook of combinatorics (vol.\u00a01). MIT Press, Cambridge, pp 179\u2013232 (Chap.\u00a03)"},{"key":"9537_CR15","first-page":"216","volume-title":"Proceedings of the 10th annual ACM symposium on theory of computing","author":"T Schaefer","year":"1978","unstructured":"Schaefer T (1978) The complexity of satisfiability problems. In: Proceedings of the 10th annual ACM symposium on theory of computing, pp 216\u2013226"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9537-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9537-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9537-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:19Z","timestamp":1559276599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9537-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,21]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9537"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9537-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,21]]}}}