{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:51Z","timestamp":1725470751051},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_26","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"268-279","source":"Crossref","is-referenced-by-count":7,"title":["Finite Termination of \u201cAugmenting Path\u201d Algorithms in the Presence of Irrational Problem Data"],"prefix":"10.1007","author":[{"given":"Brian C.","family":"Dean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel X.","family":"Goemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"26_CR1","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":"26_CR2","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"1","key":"26_CR3","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":"26_CR4","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(95)00022-O","volume":"148","author":"U. Zwick","year":"1995","unstructured":"Zwick, U.: The smallest networks on which the ford-fulkerson maximum flow procedure may fail to terminate. Theoretical Computer Science\u00a0148, 165\u2013170 (1995)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:51Z","timestamp":1619493411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11841036_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}