乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T04:33:46Z","timestamp":1723264426414},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T00:00:00Z","timestamp":1414454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00453-014-9951-z","type":"journal-article","created":{"date-parts":[[2014,10,27]],"date-time":"2014-10-27T15:30:25Z","timestamp":1414423825000},"page":"440-465","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["The Hospitals\/Residents Problem with Lower Quotas"],"prefix":"10.1007","volume":"74","author":[{"given":"Koki","family":"Hamada","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Shuichi","family":"Miyazaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,10,28]]},"reference":[{"key":"9951_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost stable\u201d matchings in the roommates problem. In: Proceedings of WAOA 2005, LNCS 3879, pp. 1\u201314 (2006)","DOI":"10.1007\/11671411_1"},{"issue":"1","key":"9951_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73\u201390 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"9951_CR3","doi-asserted-by":"crossref","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 Appl. Math. 68, 203\u2013207 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9951_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"9951_CR5","first-page":"201","volume":"2010","author":"A Bhaskara","year":"2010","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities\u2014an $$O(n^{1\/4})$$ O ( n 1 \/ 4 ) approximation for densest $$k$$ k -subgraph. Proc. STOC 2010, 201\u2013210 (2010)","journal-title":"Proc. STOC"},{"issue":"34\u201336","key":"9951_CR6","doi-asserted-by":"crossref","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."},{"issue":"16\u201318","key":"9951_CR7","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 411(16\u201318), 1828\u20131841 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9951_CR8","unstructured":"Canadian Resident Matching Service (CaRMS), http:\/\/www.carms.ca\/"},{"key":"9951_CR9","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1145\/509907.509985","volume":"2002","author":"U Feige","year":"2002","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. Proc. STOC 2002, 534\u2013543 (2002)","journal-title":"Proc. STOC"},{"key":"9951_CR10","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense $$k$$ k -subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"9951_CR11","first-page":"135","volume":"2012","author":"T Fleiner","year":"2012","unstructured":"Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. Proc. SODA 2012, 135\u2013142 (2012)","journal-title":"Proc. SODA"},{"key":"9951_CR12","first-page":"448","volume":"83","author":"HN Gabow","year":"1983","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. Proc. STOC 83, 448\u2013456 (1983)","journal-title":"Proc. STOC"},{"key":"9951_CR13","doi-asserted-by":"crossref","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. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9951_CR14","doi-asserted-by":"crossref","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 Appl. Math. 11, 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9951_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1979)"},{"key":"9951_CR16","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, MA (1989)"},{"key":"9951_CR17","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results of the stable marriage problem. ACM Trans. Algorithms 3(3) Article No. 30 (2007)","DOI":"10.1145\/1273340.1273346"},{"key":"9951_CR18","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)"},{"issue":"18","key":"9951_CR19","doi-asserted-by":"crossref","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. Inf. Process. Lett. 109(18), 1036\u20131040 (2009)","journal-title":"Inf. Process. Lett."},{"key":"9951_CR20","doi-asserted-by":"crossref","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: The hospitals\/residents problem with quota lower bounds. In: Proc. ESA 2011, LNCS 6942, pp. 180\u2013191 (2011)","DOI":"10.1007\/978-3-642-23719-5_16"},{"key":"9951_CR21","first-page":"1235","volume":"2010","author":"C-C Huang","year":"2010","unstructured":"Huang, C.-C.: Classified stable matching. Proc. SODA 2010, 1235\u20131253 (2010)","journal-title":"Proc. SODA"},{"key":"9951_CR22","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The hospital\/residents problem with ties. In: Proceedings of SWAT 2000, LNCS 1851, pp. 259\u2013271 (2000)","DOI":"10.1007\/3-540-44985-X_24"},{"issue":"15","key":"9951_CR23","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discrete Appl. Math."},{"key":"9951_CR24","first-page":"136","volume":"2004","author":"S Khot","year":"2004","unstructured":"Khot, S.: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. Proc. FOCS 2004, 136\u2013145 (2004)","journal-title":"Proc. FOCS"},{"issue":"2","key":"9951_CR25","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9951_CR26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"EJ McDermid","year":"2010","unstructured":"McDermid, E.J., Manlove, D.F.: Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. J. Comb. Optim. 19(3), 279\u2013303 (2010)","journal-title":"J. Comb. Optim."},{"key":"9951_CR27","doi-asserted-by":"crossref","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 11, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"9951_CR28","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE 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. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"9","key":"9951_CR29","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"CP Teo","year":"2001","unstructured":"Teo, C.P., Sethuraman, J.V., Tan, W.P.: Gale\u2013Shapley stable marriage problem revisited: strategic issues and applications. Manag. Sci. 47(9), 1252\u20131267 (2001)","journal-title":"Manag. Sci."},{"key":"9951_CR30","doi-asserted-by":"crossref","unstructured":"Vinterbo, S.A.: A stab at approximating minimum subadditive join. In: Proceedings of WADS 2007, LNCS 4619, pp. 214\u2013225 (2007)","DOI":"10.1007\/978-3-540-73951-7_19"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9951-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9951-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9951-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T16:20:28Z","timestamp":1689610828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9951-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,28]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9951"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9951-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,28]]}}}