{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:36Z","timestamp":1725570456118},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_15","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"145-156","source":"Crossref","is-referenced-by-count":2,"title":["Popularity at Minimum Cost"],"prefix":"10.1007","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","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto-optimality in house allocation problems. In: Proceedings of 15th Annual International Symposium on Algorithms and Computation, pp. 3\u201315 (2004)","DOI":"10.1007\/978-3-540-30551-4_3"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/06067328X","volume":"37","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing\u00a037(4), 1030\u20131045 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR3","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. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"R.W. Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Transactions on Algorithms\u00a02(4), 602\u2013610 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp. 574\u2013584 (2009)","DOI":"10.1007\/978-3-642-02927-1_48"},{"issue":"14","key":"15_CR6","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1016\/j.dam.2009.06.004","volume":"157","author":"T. Kavitha","year":"2009","unstructured":"Kavitha, T., Nasre, M.: Note: Optimal popular matchings. Discrete Applied Mathematics\u00a0157(14), 3181\u20133186 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Nasre, M.: Popular matchings with variable job capacities. In: Proceedings of 20th Annual International Symposium on Algorithms and Computation, pp. 423\u2013433 (2009)","DOI":"10.1007\/978-3-642-10631-6_44"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Nasre, M., Nimbhorkar, P.: Popularity at minimum cost. In: CoRR (2010) abs\/1009.2591","DOI":"10.1007\/978-3-642-17517-6_15"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Manlove, D., Sng, C.: Popular matchings in the capacitated house allocation problem. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 492\u2013503 (2006)","DOI":"10.1007\/11841036_45"},{"key":"15_CR11","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: Proceedings of the 15th Latin American Symposium on Theoretical Informatics, pp. 593\u2013604 (2008)","DOI":"10.1007\/978-3-540-78773-0_51"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"McDermid, E., Irving, R.W.: Popular matchings: Structure and algorithms. In: Proceedings of 15th Annual International Computing and Combinatorics Conference, pp. 506\u2013515 (2009)","DOI":"10.1007\/978-3-642-02882-3_50"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. In: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, pp. 715\u2013726 (2006)","DOI":"10.1007\/11786986_62"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:25Z","timestamp":1559836165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}