{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:58Z","timestamp":1725525358872},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_21","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"238-249","source":"Crossref","is-referenced-by-count":0,"title":["The Generalized Stable Allocation Problem"],"prefix":"10.1007","author":[{"given":"Brian C.","family":"Dean","sequence":"first","affiliation":[]},{"given":"Namrata","family":"Swar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M. Baiou","year":"2000","unstructured":"Baiou, M., Balinski, M.: Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics\u00a0101, 1\u201312 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/moor.27.4.662.302","volume":"27","author":"M. Baiou","year":"2002","unstructured":"Baiou, M., Balinski, M.: Erratum: The stable allocation (or ordinal transportation) problem. Mathematics of Operations Research\u00a027(4), 662\u2013680 (2002)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/11841036_26","volume-title":"Algorithms \u2013 ESA 2006","author":"B.C. Dean","year":"2006","unstructured":"Dean, B.C., Immorlica, N., Goemans, M.X.: Finite termination of \u201caugmenting path\u201d algorithms in the presence of irrational problem data. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 268\u2013279. Springer, Heidelberg (2006)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Dean, B.C., Immorlica, N., Goemans, M.X.: The unsplittable stable marriage problem. In: Proceedings of the 4th IFIP International Conference on Theoretical Computer Science (2006)","DOI":"10.1007\/978-0-387-34735-6_9"},{"key":"21_CR5","unstructured":"Dean, B.C., Munshi, S.: Faster algorithms for stable allocation problems. In: Proceedings of the 1st MATCH-UP (Matching Under Preferences) Workshop, pp. 133\u2013144 (2008)"},{"issue":"1","key":"21_CR6","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(1), 9\u201314 (1962)","journal-title":"American Mathematical Monthly"},{"key":"21_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completenes","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completenes. W.H. Freeman, New York (1979)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R.W. Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u201d stable marriage. Journal of the ACM\u00a034(3), 532\u2013543 (1987)","journal-title":"Journal of the ACM"},{"key":"21_CR9","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. Journal of Political Economy\u00a092, 991\u20131016 (1984)","journal-title":"Journal of Political Economy"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D..D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:07:50Z","timestamp":1551773270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}