{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:26Z","timestamp":1725664526394},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:15:05Z","timestamp":1330276505000},"page":"185-197","source":"Crossref","is-referenced-by-count":0,"title":["Generalized max flows and augmenting paths"],"prefix":"10.1007","author":[{"given":"David","family":"Hartvigsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"15_CR1","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"M.S. Bazaraa, J.J. Jarvis, H.D. Sherali. Linear Programming and Network Flows. John Wiley & Sons, New York, 1990."},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham. Optimal attack and reinforcement of a network. J. Assoc. Comput. Mach. 32 (1985) 549\u2013561","journal-title":"J. Assoc. Comput. Mach."},{"key":"15_CR3","first-page":"1277","volume":"2","author":"E.A. Dinic","year":"1970","unstructured":"E.A. Dinic. Algorithm for a solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 2 (1970) 1277\u20131280.","journal-title":"Soviet Math. Dokl."},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. of ACM 19 (1972) 248\u2013264.","journal-title":"J. of ACM"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"IT-2","author":"P. Elias","year":"1956","unstructured":"P. Elias, A. Feinstein, and C.E. Shannon. Note on maximum flow through a network. IRE Transactions on Information Theory IT-2 (1956) 117\u2013119.","journal-title":"IRE Transactions on Information Theory"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"L.R. Ford and D.R. Fulkerson. Maximal flow through a network. Canadian J. of Math., 8 (1956) 399\u2013404.","journal-title":"Canadian J. of Math."},{"key":"15_CR7","series-title":"Lectures in Applied Mathematics","first-page":"303","volume-title":"Mathematics of the Decision Sciences, Part 1","author":"D.R. Fulkerson","year":"1968","unstructured":"D.R. Fulkerson. Networks, frames, blocking systems, in: Mathematics of the Decision Sciences, Part 1 (G.B. Dantzig and A.F. Veinott, JR., eds.), Lectures in Applied Mathematics Vol. 11, American Mathematical Society, Providence, R.I. (1968) 303\u2013334."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/nav.3800020407","volume":"2","author":"D.R Fulkerson","year":"1955","unstructured":"D.R Fulkerson and G.B. Dantzig. Computation of maximum flow in networks. Naval Reasearch Logistics Quarterly 2 (1955) 277\u2013283.","journal-title":"Naval Reasearch Logistics Quarterly"},{"issue":"No.1","key":"15_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"G. Gallo, M.D. Grigoriadis, R. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Computing, Vol. 18, No. 1 (1989) 30\u201355.","journal-title":"SIAM J. Computing"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35 (1988).","DOI":"10.1145\/48014.61051"},{"key":"15_CR11","volume-title":"Tech. Report YALEU DCS TR 481","author":"D. Gusfield","year":"1986","unstructured":"D. Gusfield. On scheduling transmissions in a network. Tech. Report YALEU DCS TR 481, Department of Computer Science, Yale University, New Haven, CT, 1986."},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0196-6774(85)90010-0","volume":"6","author":"A. Itai","year":"1985","unstructured":"A. Itai and M. Rodeh. Scheduling transmissions in a network. J. of Algorithms 6 (1985) 409\u2013429.","journal-title":"J. of Algorithms"},{"key":"15_CR13","unstructured":"S.T. McCormick and T.R. Ervolina. Computing maximum mean cuts. UBC Faculty of Commerce Working Paper 90-MCS-011, 1990."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J.Assoc.Comput.Mach., 30 (1983) 852\u2013865.","journal-title":"J.Assoc.Comput.Mach."},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0196-6774(92)90006-X","volume":"13","author":"C.H. Norton","year":"1992","unstructured":"C.H. Norton, S.A. Plotkin, and Eva Tardos. Using separation algorithms in fixed dimension. Journal of Algorithms 13 (1992) 79\u201398.16.","journal-title":"Journal of Algorithms"},{"key":"15_CR16","unstructured":"T. Radzik. Parametric flows, weighted means of cuts, and fractional combinatorial optimization. Working paper, School of Operations Research, Cornell University."},{"key":"15_CR17","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986."},{"key":"15_CR18","first-page":"114","volume-title":"Theory of Computing","author":"D.D. Sleator","year":"1981","unstructured":"D.D. Sleator and E.T. Tarjan. A data structure for dynamic trees. 13th ACM Symops. Theory of Computing. Milwaukee, Wisconsin (1981) 114\u2013122."},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/nav.3800190202","volume":"19","author":"V. Srinivasin","year":"1972","unstructured":"V. Srinivasin and G.L. Thompson. An operator theory of parametric programming for the transportation problem. Naval Research Logistics Quarterly 19 (1972) 205\u2013252.","journal-title":"Naval Research Logistics Quarterly"},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"E. Tardos. A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34 (1986) 250\u2013256.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:18Z","timestamp":1619573238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}