{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T00:24:53Z","timestamp":1652574293630},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540436768","type":"print"},{"value":"9783540478676","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_5","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"54-66","source":"Crossref","is-referenced-by-count":6,"title":["A New Min-Cut Max-Flow Ratio for Multicommodity Flows"],"prefix":"10.1007","author":[{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539794285983","volume":"27","author":"Y. Aumann","year":"1998","unstructured":"Y. Aumann and Y. Rabani: Approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing 27 (1998) 291\u2013301","journal-title":"SIAM Journal on Computing"},{"key":"5_CR2","first-page":"213","volume":"68","author":"D. Bienstock","year":"1995","unstructured":"D. Bienstock and O. G\u00fcnl\u00fck: Computational experience with a difficult multicommodity flow problem. Mathematical Programming 68 (1995) 213\u2013238","journal-title":"Mathematical Programming"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"J. Bourgain: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics 52 (1985) 46\u201352","journal-title":"Israel Journal of Mathematics"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0012-365X(95)00154-O","volume":"160","author":"P. Fishburn","year":"1996","unstructured":"\u201dP. Fishburn and P. Hammer: Bipartite dimensions and bipartite degrees of graphs. Discrete Math. 160 (1996) 127\u2013148","journal-title":"Discrete Math."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"L. R. Ford Jr. and D. R. Fulkerson: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"N. Garg, V.V. Vazirani and M. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993) 698\u2013707","DOI":"10.1145\/167088.167266"},{"key":"5_CR7","first-page":"129","volume":"13","author":"M. Iri","year":"1971","unstructured":"M. Iri: On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan 13 (1971) 129\u2013135","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1090\/conm\/026\/737400","volume":"26","author":"W. Johnson","year":"1984","unstructured":"W. Johnson and J. Lindenstrauss: Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics 26 (1984) 189\u2013206","journal-title":"Contemporary Mathematics"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0024-3795(89)90468-0","volume":"114","author":"A. V. Karzanov","year":"1989","unstructured":"A. V. Karzanov: Polyhedra related to undirected multicommodity flows. Linear Algebra and its Applications 114 (1989) 293\u2013328","journal-title":"Linear Algebra and its Applications"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01200755","volume":"15","author":"P. Klein","year":"1995","unstructured":"P. Klein, S. Rao, A. Agrawal, and R. Ravi: An approximate max-flow min-cut relation for undirected multicommodity flow with applications. Combinatorica 15 (1995) 187\u2013202","journal-title":"Combinatorica"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"F.T. Leighton and S. Rao: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 422\u2013431","DOI":"10.1109\/SFCS.1988.21958"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London, and Y. Rabinovich (1995): The geometry of graphs and some of its algorithmic applications. Combinatorica 15 215\u2013245","journal-title":"Combinatorica"},{"key":"5_CR13","unstructured":"C. Lund, S. Phillips and N. Reingold: Private communication"},{"key":"5_CR14","first-page":"543","volume-title":"Graph Theory and its Applications to Algorithms and Computer Science","author":"D. W. Matula","year":"1985","unstructured":"D. W. Matula: Concurrent flow and concurrent connectivity in graphs. in Graph Theory and its Applications to Algorithms and Computer Science Wiley New York (1985) 543\u2013559"},{"key":"5_CR15","doi-asserted-by":"publisher","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan: Randomized Algorithms. Cambridge University Press Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"H. Okamura and P. Seymour: Multicommodity flows in planar graphs. Journal of Comput. Theory-Ser. B 31 (1981) 75\u201381","journal-title":"Journal of Comput. Theory-Ser. B"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"4","author":"K. Onaga","year":"1971","unstructured":"K. Onaga, and O. Kakusho: On feasibility conditions of multicommodity flows in networks. IEEE Transactions on Circuit Theory CT-18 4 (1971) 425\u2013429","journal-title":"IEEE Transactions on Circuit Theory CT-18"},{"key":"5_CR18","doi-asserted-by":"publisher","volume-title":"The Volume of Convex Bodies and Banach Space Geometry","author":"G. Pisier","year":"1989","unstructured":"G. Pisier: The Volume of Convex Bodies and Banach Space Geometry. Cambridge University Press Cambridge (1989)","DOI":"10.1017\/CBO9780511662454"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"S. Plotkin and E. Tardos: Improved Bounds on the max-flow min-cut ratio for multicommodity flows. Proceedings 25\u2019th Symposium on Theory of Computing (1993)","DOI":"10.1145\/167088.167263"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"F. Shahrokhi and D. W. Matula: The maximum concurrent flow problem. Journal of Association for Computing Machinery 37 (1990) 318\u2013334","journal-title":"Journal of Association for Computing Machinery"},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01305312","volume":"29","author":"S. Tragoudas","year":"1996","unstructured":"S. Tragoudas: Improved approximations for the min-cut max-flow ratio and the flux. Mathematical Systems Theory 29 (1996) 157\u2013167","journal-title":"Mathematical Systems Theory"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:31:28Z","timestamp":1556436688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":21,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-47867-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2002]]}}}