{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:38:00Z","timestamp":1718923080300},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00403-1","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T07:31:32Z","timestamp":1060327892000},"page":"75-97","source":"Crossref","is-referenced-by-count":16,"title":["Improving time bounds on maximum generalised flow computations by contracting the network"],"prefix":"10.1016","volume":"312","author":[{"given":"Tomasz","family":"Radzik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00403-1_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0304-3975(03)00403-1_BIB2","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"issue":"12","key":"10.1016\/S0304-3975(03)00403-1_BIB3","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1287\/mnsc.24.12.1209","article-title":"Generalized networks: a fundamental computer-based planning tool","volume":"24","author":"Glover","year":"1978","journal-title":"Manage. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(03)00403-1_BIB4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/moor.16.2.351","article-title":"Combinatorial algorithms for the generalized circulation problem","volume":"16","author":"Goldberg","year":"1991","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB5","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","article-title":"Finding minimum-cost circulations by successive approximation","volume":"15","author":"Goldberg","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB6","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1287\/moor.21.3.529","article-title":"A faster combinatorial algorithm for the generalized circulation problem","volume":"21","author":"Goldfarb","year":"1996","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB7","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/moor.22.4.793","article-title":"Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem","volume":"22","author":"Goldfarb","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB8","unstructured":"A. Kamath, O. Palmon, Improved interior point algorithms for exact and approximate solution of multicommodity flow problems, in: Proc. 6th Annu. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 1995, pp. 502\u2013511."},{"issue":"1","key":"10.1016\/S0304-3975(03)00403-1_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02592100","article-title":"Speeding up Karmarkar's algorithm for multicommodity flows","volume":"73","author":"Kapoor","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0304-3975(03)00403-1_BIB10","unstructured":"S.M. Murray, An interior point approach to the generalized flow problem with costs and related problems, Ph.D. Thesis, Stanford University, August 1992."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB11","doi-asserted-by":"crossref","unstructured":"K. Onaga, Optimal flows in general communication networks, J. Franklin Inst. 283.","DOI":"10.1016\/0016-0032(67)90046-4"},{"issue":"1","key":"10.1016\/S0304-3975(03)00403-1_BIB12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/moor.23.1.69","article-title":"Faster algorithms for the generalized network flow problem","volume":"23","author":"Radzik","year":"1998","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB13","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(03)00403-1_BIB14","doi-asserted-by":"crossref","unstructured":"E. Tardos, K. Wayne, Simple generalized maximum flow algorithms, in: Proc. 6th Internat. Conf. on Integer Programming and Combinatorial Optimization, Houston, Texas, 1998, pp. 310\u2013324.","DOI":"10.1007\/3-540-69346-7_24"},{"key":"10.1016\/S0304-3975(03)00403-1_BIB15","doi-asserted-by":"crossref","unstructured":"P. M. Vaidya, Speeding up linear programming using fast matrix multiplication, in: Proc. 30th IEEE Annu. Symp. on Foundations of Computer Science, Research Triangle Park, North Carolina, 1989, pp. 332\u2013337.","DOI":"10.1109\/SFCS.1989.63499"},{"key":"10.1016\/S0304-3975(03)00403-1_BIB16","doi-asserted-by":"crossref","unstructured":"K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, in: Proc. 31st Annu. ACM Symp. on Theory of Computing, Atlanta, Georgia, 1999.","DOI":"10.1145\/301250.301261"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503004031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T05:49:46Z","timestamp":1585115386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503004031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503004031"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00403-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}