{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:12Z","timestamp":1744217412775},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01200755","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:13:34Z","timestamp":1108728814000},"page":"187-202","source":"Crossref","is-referenced-by-count":37,"title":["An approximate max-flow min-cut relation for undirected multicommodity flow, with applications"],"prefix":"10.1007","volume":"15","author":[{"given":"Philip","family":"Klein","sequence":"first","affiliation":[]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Ajit","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"F. Barahona: On via minimization,IEEE Trans. Circuits Syst. 37, 410?416.","DOI":"10.1109\/31.52754"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F. Barahona","year":"1988","unstructured":"F. Barahona, M. Gr\ufffdtschel, M. J\ufffdnger, andG. Reinelt: An application of combinatorial optimization to statistical physics and circuit layout design,Operations Research 36 (1988), 493?513.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TCS.1983.1085357","volume":"30","author":"R.-W. Chen","year":"1983","unstructured":"R.-W. Chen, Y. Kajitani, andS.-P. Chan: A graph-theoretic via minimization algorithm for two-layer printed circuit boards,IEEE Trans. Circuits Systems, CAS-30 (1983), 284?299.","journal-title":"IEEE Trans. Circuits Systems, CAS"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0402004","volume":"2","author":"H. Choi","year":"1989","unstructured":"H. Choi, K. Nakajima, andC.S. Rim: Graph bipartization and via minimization,SIAM J. of Discrete Math. 2 (1989), 38?47.","journal-title":"SIAM J. of Discrete Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V. Chv\ufffdtal","year":"1973","unstructured":"V. Chv\ufffdtal: Tough graphs and Hamiltonian circuits,Discrete Mathematics 5 (1973), 215?228.","journal-title":"Discrete Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"E. Dahlhous, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, andM. Yannakakis: The complexity of multiway cuts,Proc. 24th ACM Symposium on Theory of Computing (1992), 241?251.","DOI":"10.1145\/129712.129736"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P. Elias","year":"1956","unstructured":"P. Elias, A. Feinstein, andC.E. Shannon: A note on the maximum flow through a network,IRS Trans. Information Theory IT 2 (1956), 117?119.","journal-title":"IRS Trans. Information Theory IT"},{"key":"CR8","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford, Jr., andD. R. Fulkerson:Flows in Networks, Princeton University Press, Princeton, New Jersey (1962)."},{"key":"CR9","unstructured":"A. Frank: Packing paths, circuits, and cuts?a survey, in:Paths, Flows, and VLSI Layout, ed. B. Korte, L. Lov\ufffdsz, H.J. Pr\ufffdmel, A. Schrijver, Springer-Verlag (1990), 47?100."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"N. Garg, V. V. Vazirani, andM. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications.Proc. 25th ACM Symposium on the Theory of Computing (1993), 698?707.","DOI":"10.1145\/167088.167266"},{"key":"CR11","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, andD. S. Johnson:Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco (1979)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"T. C. Hu","year":"1963","unstructured":"T. C. Hu: Multicommodity network flows,Operations Research 11, (1963), 344?360.","journal-title":"Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson: Approximation algorithms for combinatorial problems,Journal of Computer and System Sciences 9 (1974), 256?278.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","volume":"10","author":"N. D. Jones","year":"1976","unstructured":"N. D. Jones, Y. E. Lien, andW. T. Lasser: New problems complete for nondeterministic log space,Math. Systems Theory,10 (1976), 1?17.","journal-title":"Math. Systems Theory"},{"key":"CR15","unstructured":"P. Klein, S. Plotkin, andS. Rao: Planar graphs, multicommodity flow, and network decomposition.Proc. 25th ACM Symposium on the Theory of Computing (1991), 682?690."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"P. Klein, S. Plotkin, S. Rao, and\ufffd. Tardos: Bounds on the max-flow min-cut ratio for directed multicommodity flows, Brown University Technical Report CS-93-30 (1993).","DOI":"10.1145\/167088.167263"},{"key":"CR17","unstructured":"P. Klein, S. Plotkin, C. Stein, and\ufffd. Tardos: Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts,SIAM Journal on Computing, to appear."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, F. Makedon, S. Plotkin, C. Stein, \ufffd. Tardos, S. Tragoudas: Fast approximation algorithms for multicommodity flow problems,Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991), 101?111.","DOI":"10.1145\/103418.103425"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, andS. Rao: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms,Proceedings, 29th Symposium on Foundations of Computer Science (1988), 422?431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"CR20","unstructured":"F. T. Leighton, F. Makedon, andS. Tragoudas: personal communication, 1990"},{"key":"CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/BFb0039624","volume-title":"Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science","author":"P. Molitor","year":"1987","unstructured":"P. Molitor: On the contact-minimization problem,Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science (1987), published asLecture Notes in Computer Science 247, Springer-Verlag, New York, Berlin (1987), 420?431."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"N. Naclerio, S. Masuda, andK. Nakajima: Via minimization for gridless layouts,Proc. 24th ACM\/IEEE Design Automation Conference (1987), 159?165.","DOI":"10.1145\/37888.37912"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"N. Naclerio, S. Masuda, andK. Nakajima: The via minimization problem is NP-complete,IEEE Trans. Comput. 38, 1604?1608.","DOI":"10.1109\/12.42135"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, andM. Yannakakis: Optimization, approximation, and complexity classes,Proceedings, 20th ACM Symposium on Theory of Computing (1988), 229?234.","DOI":"10.1145\/62212.62233"},{"key":"CR25","first-page":"123","volume":"1","author":"R. Pinter","year":"1984","unstructured":"R. Pinter: Optimal layer assignment for interconnect,Journal of VLSI and Computer Systems 1 (1984), 123?137.","journal-title":"Journal of VLSI and Computer Systems"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/0219018","volume":"19","author":"D. Plaisted","year":"1990","unstructured":"D. Plaisted: A heuristic algorithm for small separators in arbitrary graphs,SIAM J. Comput. 19 (1990), 267?280.","journal-title":"SIAM J. Comput."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"S. Plotkin, and\ufffd. Tardos: Improved bounds on the max-flow min-cut ratio for multicommodity flows.Proc. 25th ACM Symposium on the Theory of Computing (1993), 691?697.","DOI":"10.1145\/167088.167263"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"S. Rao: Finding near optimal separators in planar graphs,Proceedings, 28th Annual Symposium on Foundations of Computer Science (1987), 225?237.","DOI":"10.1109\/SFCS.1987.26"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-642-68874-4_18","volume-title":"Mathematical Programming, the state of the art","author":"A. Schrijver","year":"1983","unstructured":"A. Schrijver: Min-max results in combinatorial optimization,Mathematical Programming, the state of the art. Springer-Verlag, Bonn (1983), 439?500."},{"issue":"2","key":"CR30","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"F. Shahrokhi, andD. Matula: The maximum concurrent flow problem,Journal of the ACM 37:2 (1990), 318?334","journal-title":"Journal of the ACM"},{"key":"CR31","unstructured":"S. Tragoudas: VLSI partitioning approximation algorithms based on multicommodity flow and other techniques, PhD thesis, University of Texas at Dallas (1991)."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis: Edge-Deletion problems,SIAM J. Computing 10, (1981), 297?309.","journal-title":"SIAM J. Computing"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200755.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200755\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T06:46:13Z","timestamp":1683009973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01200755"],"URL":"https:\/\/doi.org\/10.1007\/bf01200755","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}