{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:16Z","timestamp":1725603676509},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_15","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"167-179","source":"Crossref","is-referenced-by-count":2,"title":["Near-Popular Matchings in the Roommates Problem"],"prefix":"10.1007","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","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_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","volume-title":"Algorithms and Complexity","author":"P. Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular Matchings in the Marriage and Roommates Problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 97\u2013108. Springer, Heidelberg (2010)"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"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. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"key":"15_CR5","volume-title":"Computers and Intractablility","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractablility. Freeman, New York (1979)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-22006-7_56","volume-title":"Automata, Languages and Programming","author":"C.-C. Huang","year":"2011","unstructured":"Huang, C.-C., Kavitha, T.: Popular Matchings in the Stable Marriage Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 666\u2013677. Springer, Heidelberg (2011)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R.W. Irving","year":"1985","unstructured":"Irving, R.W.: An Efficient Algorithm for the \u201cStable Roommates\u201d Problem. Journal of Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"Journal of Algorithms"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-642-02927-1_48","volume-title":"Automata, Languages and Programming","author":"T. Kavitha","year":"2009","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 574\u2013584. Springer, Heidelberg (2009)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: Proceedings of the ACM EC 2006, pp. 238\u2013242 (2006)","DOI":"10.1145\/1134707.1134733"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11841036_45","volume-title":"Algorithms \u2013 ESA 2006","author":"D.F. Manlove","year":"2006","unstructured":"Manlove, D.F., Sng, C.T.S.: Popular matchings in the capacitated house allocation problem. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 492\u2013503. Springer, Heidelberg (2006)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-78773-0_51","volume-title":"LATIN 2008: Theoretical Informatics","author":"R.M. McCutchen","year":"2008","unstructured":"McCutchen, R.M.: The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 593\u2013604. Springer, Heidelberg (2008)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/11786986_62","volume-title":"Automata, Languages and Programming","author":"J. Mestre","year":"2006","unstructured":"Mestre, J.: Weighted popular matchings. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 715\u2013726. Springer, Heidelberg (2006)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0196-6774(91)90028-W","volume":"12","author":"J.J.M. Tan","year":"1991","unstructured":"Tan, J.J.M.: A necessary and sufficient condition for the existence of a complete stable matching. Journal of Algorithms\u00a012, 154\u2013178 (1991)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T11:09:33Z","timestamp":1554116973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}