{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T02:19:31Z","timestamp":1773368371986,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":14,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_271","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:04:14Z","timestamp":1461269054000},"page":"1470-1473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Stable Marriage"],"prefix":"10.1007","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"263_CR15190","first-page":"513","volume-title":"Proceedings of 21st ACM symposium on theory of computing, Seattle, May 1989","author":"T Feder","year":"1989","unstructured":"Feder T (1989) A new fixed point approach for stable networks and stable marriages. In: Proceedings of 21st ACM symposium on theory of computing, Seattle, May 1989. ACM, New York, pp\u00a0513\u2013522"},{"key":"263_CR15191","unstructured":"Feder T (1991) Stable networks and product graphs. Ph.D. thesis, Stanford University"},{"key":"263_CR15192","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T Feder","year":"1992","unstructured":"Feder T (1992) A new fixed point approach for stable networks and stable marriages. J Comput Syst Sci 45:233\u2013284","journal-title":"J Comput Syst Sci"},{"key":"263_CR15193","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T Feder","year":"1994","unstructured":"Feder T (1994) Network flow and 2-satisfiability. Algorithmica 11:291\u2013319","journal-title":"Algorithmica"},{"key":"263_CR15194","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9\u201315","journal-title":"Am Math Mon"},{"issue":"1","key":"263_CR15195","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield D (1987) Three fast algorithms for four problems in stable marriage. SIAM J Comput 16(1):111\u2013128","journal-title":"SIAM J Comput"},{"issue":"4","key":"263_CR15196","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/0217048","volume":"17","author":"D Gusfield","year":"1988","unstructured":"Gusfield D (1988) The structure of the stable roommate problem: efficient representation and enumeration of all stable assignments. SIAM J Comput 17(4):742\u2013769","journal-title":"SIAM J Comput"},{"key":"263_CR15197","volume-title":"The stable marriage problem: structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT, Cambridge"},{"key":"263_CR15198","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving RW (1985) An efficient algorithm for the stable roommates problem. J Algorithms 6:577\u2013595","journal-title":"J Algorithms"},{"issue":"3","key":"263_CR15199","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving RW, Leather P (1986) The complexity of counting stable marriages. SIAM J Comput 15(3):655\u2013667","journal-title":"SIAM J Comput"},{"issue":"3","key":"263_CR15200","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the \u201coptimal stable\u201d marriage. J ACM 34(3):532\u2013543","journal-title":"J ACM"},{"key":"263_CR15201","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A Kato","year":"1993","unstructured":"Kato A (1993) Complexity of the sex-equal stable marriage problem. Jpn J Ind Appl Math 10:1\u201319","journal-title":"Jpn J Ind Appl Math"},{"key":"263_CR15202","volume-title":"Mariages stables","author":"DE Knuth","year":"1976","unstructured":"Knuth DE (1976) Mariages stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al"},{"key":"263_CR15203","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove DF (2013) Algorithmics of matching under preferences. World Scientific, Singapore"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:12:26Z","timestamp":1553098346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_271","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}