{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:37Z","timestamp":1725809257043},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_53","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:11:32Z","timestamp":1415981492000},"page":"713-728","source":"Crossref","is-referenced-by-count":1,"title":["The Popular Matching and Condensation Problems Under Matroid Constraints"],"prefix":"10.1007","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"4","key":"53_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."},{"issue":"3","key":"53_CR2","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(3), 166\u2013173 (1975)","journal-title":"Behav. Sci."},{"key":"53_CR3","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":"DF 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. 4168, pp. 492\u2013503. Springer, Heidelberg (2006)"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. ACM Trans. Algorithms 10(1) (2014). Article 2","DOI":"10.1145\/2556951"},{"issue":"2","key":"53_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.jda.2008.11.008","volume":"8","author":"CTS Sng","year":"2010","unstructured":"Sng, C.T.S., Manlove, D.F.: Popular matchings in the weighted capacitated house allocation problem. J. Discrete Algorithms 8(2), 102\u2013116 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"12","key":"53_CR6","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.tcs.2010.12.067","volume":"412","author":"T Kavitha","year":"2011","unstructured":"Kavitha, T., Nasre, M.: Popular matchings with variable item copies. Theor. Comput. Sci. 412(12), 1263\u20131274 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"53_CR7","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/s10878-012-9537-0","volume":"27","author":"T Kavitha","year":"2014","unstructured":"Kavitha, T., Nasre, M., Nimbhorkar, P.: Popularity at minimum cost. J. Comb. Optim. 27(3), 574\u2013596 (2014)","journal-title":"J. Comb. Optim."},{"key":"53_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-45278-9_35","volume-title":"Combinatorial Algorithms","author":"Y-W Wu","year":"2013","unstructured":"Wu, Y.-W., Lin, W.-Y., Wang, H.-L., Chao, K.-M.: An optimal algorithm for the popular condensation problem. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 412\u2013422. Springer, Heidelberg (2013)"},{"issue":"1","key":"53_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28(1), 103\u2013126 (2003)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"53_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/moor.1070.0227","volume":"32","author":"S Fujishige","year":"2007","unstructured":"Fujishige, S., Tamura, A.: A two-sided discrete-concave market with possibly bounded side payments: an approach by discrete convex analysis. Math. Oper. Res. 32(1), 136\u2013155 (2007)","journal-title":"Math. Oper. Res."},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. In: SODA, pp. 135\u2013142 (2012)","DOI":"10.1137\/1.9781611973099.12"},{"issue":"34\u201336","key":"53_CR12","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.tcs.2010.05.005","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Fleiner, T., Irving, R.W., Manlove, D.F.: The college admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34\u201336), 3136\u20133153 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"53_CR13","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"53_CR14","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"issue":"1","key":"53_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0002-9947-1971-0286689-5","volume":"158","author":"M Aigner","year":"1971","unstructured":"Aigner, M., Dowling, T.A.: Matching theory for combinatorial geometries. Trans. Am. Math. Soc. 158(1), 231\u2013245 (1971)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"53_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"EL Lawler","year":"1975","unstructured":"Lawler, E.L.: Matroid intersection algorithms. Math. Program. 9(1), 31\u201356 (1975)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:35:23Z","timestamp":1559054123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}