{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:53Z","timestamp":1759638893109},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_16","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"180-191","source":"Crossref","is-referenced-by-count":12,"title":["The Hospitals\/Residents Problem with Quota Lower Bounds"],"prefix":"10.1007","author":[{"given":"Koki","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11671411_1","volume-title":"Approximation and Online Algorithms","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost stable\u201d matchings in the roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 1\u201314. Springer, Heidelberg (2006)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"D.J. Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the Student-Project Allocation problem. J. Discrete Algorithms\u00a05(1), 73\u201390 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(96)89151-7","volume":"68","author":"B. Aldershof","year":"1996","unstructured":"Aldershof, B., Carducci, O.M.: Stable matchings with couples. Discrete Applied Mathematics\u00a068, 203\u2013207 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities \u2013 an O(n 1\/4) approximation for densest k-subgraph. In: Proc. STOC 2010, pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"issue":"34-36","key":"16_CR5","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. Theoretical Computer Science\u00a0411(34-36), 3136\u20133153 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"16-18","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.tcs.2010.02.003","volume":"411","author":"P. Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoretical Computer Science\u00a0411(16-18), 1828\u20131841 (2010)","journal-title":"Theoretical Computer Science"},{"key":"16_CR7","unstructured":"Canadian Resident Matching Service (CaRMS), http:\/\/www.carms.ca\/"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. STOC 2002, pp. 534\u2013543 (2002)","DOI":"10.1145\/509907.509985"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. STOC 1983, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"16_CR10","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. Amer. Math. Monthly\u00a069, 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"16_CR11","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. Discrete Applied Mathematics\u00a011, 223\u2013232 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR12","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)"},{"key":"16_CR13","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: The hospitals\/residents problem with quota lower bounds. In: Proc. MATCH-UP (satellite workshop of ICALP 2008), pp. 55\u201366 (2008)"},{"key":"16_CR14","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: The hospitals\/residents problem with quota lower bounds (manuscript) , http:\/\/www.lab2.kuis.kyoto-u.ac.jp\/~shuichi\/ESA11\/esa11-final-long.pdf"},{"issue":"18","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.ipl.2009.06.008","volume":"109","author":"K. Hamada","year":"2009","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: An improved approximation lower bound for finding almost stable maximum matchings. Information Processing Letters\u00a0109(18), 1036\u20131040 (2009)","journal-title":"Information Processing Letters"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Huang, C.-C.: Classified stable matching. In: Proc. SODA 2010, pp. 1235\u20131253 (2010)","DOI":"10.1137\/1.9781611973075.99"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44985-X_24","volume-title":"Algorithm Theory - SWAT 2000","author":"R.W. Irving","year":"2000","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The hospitals\/Residents problem with ties. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 259\u2013271. Springer, Heidelberg (2000)"},{"issue":"15","key":"16_CR18","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"R.W. Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Applied Math.\u00a0156(15), 2959\u20132977 (2008)","journal-title":"Discrete Applied Math."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In: Proc. FOCS\u00a02004, pp. 136\u2013145 (2004)","DOI":"10.1109\/FOCS.2004.59"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-Line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science\u00a0127(2), 255\u2013267 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica\u00a029, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"E.J. McDermid","year":"2010","unstructured":"McDermid, E.J., Manlove, D.F.: Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. Journal of Combinatorial Optimization\u00a019(3), 279\u2013303 (2010)","journal-title":"Journal of Combinatorial Optimization"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. J. Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"16_CR24","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"A.E. Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Political Economy\u00a092(6), 991\u20131016 (1984)","journal-title":"J. Political Economy"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-73951-7_19","volume-title":"Algorithms and Data Structures","author":"S.A. Vinterbo","year":"2007","unstructured":"Vinterbo, S.A.: A stab at approximating minimum subadditive join. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 214\u2013225. Springer, Heidelberg (2007)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T08:15:29Z","timestamp":1638432929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}