{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:41:54Z","timestamp":1725856914706},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_6","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"63-76","source":"Crossref","is-referenced-by-count":0,"title":["Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with\u00a0the Max-Cut Problem"],"prefix":"10.1007","author":[{"given":"Mourad","family":"Ba\u00efou","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Barahona","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0894-0347-07-00573-5","volume":"21","author":"S Arora","year":"2008","unstructured":"Arora, S., Lee, J., Naor, A.: Euclidean distortion and the sparsest cut. J. Am. Math. Soc. 21, 1\u201321 (2008)","journal-title":"J. Am. Math. Soc."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM (JACM) 56, 5 (2009)","journal-title":"J. ACM (JACM)"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F Barahona","year":"1983","unstructured":"Barahona, F.: The max-cut problem on graphs not contractible to $$K_5$$ . Oper. Res. Lett. 2, 107\u2013111 (1983)","journal-title":"Oper. Res. Lett."},{"key":"6_CR4","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"189","volume-title":"Polyhedral Combinatorics","author":"F Barahona","year":"1990","unstructured":"Barahona, F.: Planar multicommodity flows, max-cut, and the Chinese postman problem. In: Cook, W., Seymour, P.D. (eds.) Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1, pp. 189\u2013202. American Mathematical Society, Providence (1990)"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580600","volume":"60","author":"F Barahona","year":"1993","unstructured":"Barahona, F.: On cuts and matchings in planar graphs. Math. Program. 60, 53\u201368 (1993)","journal-title":"Math. Program."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"SN Bhatt","year":"1984","unstructured":"Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300\u2013343 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/3149.3154","volume":"32","author":"G Cornuejols","year":"1985","unstructured":"Cornuejols, G., Naddef, D., Pulleyblank, W.: The traveling salesman problem in graphs with 3-edge cutsets. J. ACM (JACM) 32, 383\u2013410 (1985)","journal-title":"J. ACM (JACM)"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13, 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, euler tours and the Chinese postman. Math. Program. 5, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"HN Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementation of Edmonds\u2019 algorithm for maximum matching on graphs. J. ACM (JACM) 23, 221\u2013234 (1976)","journal-title":"J. ACM (JACM)"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S089548010138917X","volume":"21","author":"O G\u00fcnl\u00fck","year":"2007","unstructured":"G\u00fcnl\u00fck, O.: A new min-cut max-flow ratio for multicommodity flows. SIAM J. Discrete Math. 21, 1\u201315 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, A., Talwar, K., Witmer, D.: Sparsest cut on bounded treewidth graphs: algorithms and hardness results. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 281\u2013290. ACM (2013)","DOI":"10.1145\/2488608.2488644"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4, 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.orl.2006.12.011","volume":"35","author":"S-P Hong","year":"2007","unstructured":"Hong, S.-P., Choi, B.-C.: Polynomiality of sparsest cuts with fixed number of sources. Oper. Res. Lett. 35, 739\u2013742 (2007)","journal-title":"Oper. Res. Lett."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"TC Hu","year":"1963","unstructured":"Hu, T.C.: Multi-commodity network flows. Oper. Res. 11, 344\u2013360 (1963)","journal-title":"Oper. Res."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 682\u2013690. ACM (1993)","DOI":"10.1145\/167088.167261"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01200755","volume":"15","author":"P Klein","year":"1995","unstructured":"Klein, P., Rao, S., Agrawal, A., Ravi, R.: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica 15, 187\u2013202 (1995)","journal-title":"Combinatorica"},{"key":"6_CR19","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Corporation, New York (1976)"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM (JACM) 46, 787\u2013832 (1999)","journal-title":"J. ACM (JACM)"},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(90)90133-W","volume":"27","author":"DW Matula","year":"1990","unstructured":"Matula, D.W., Shahrokhi, F.: Sparsest cuts and bottlenecks in graphs. Discrete Appl. Math. 27, 113\u2013123 (1990)","journal-title":"Discrete Appl. Math."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Park, J.K., Phillips, C.A.: Finding minimum-quotient cuts in planar graphs. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 766\u2013775. ACM (1993)","DOI":"10.1145\/167088.167284"},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1137\/100811416","volume":"42","author":"V Patel","year":"2013","unstructured":"Patel, V.: Determining edge expansion and other connectivity measures of graphs of bounded genus. SIAM J. Comput. 42, 1113\u20131131 (2013)","journal-title":"SIAM J. Comput."},{"key":"6_CR25","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01299746","volume":"15","author":"S Plotkin","year":"1995","unstructured":"Plotkin, S., Tardos, \u00c9.: Improved bounds on the max-flow min-cut ratio for multicommodity flows. Combinatorica 15, 425\u2013434 (1995)","journal-title":"Combinatorica"},{"key":"6_CR26","first-page":"429","volume-title":"Handbook of Combinatorial Optimization","author":"T Radzik","year":"1999","unstructured":"Radzik, T.: Fractional combinatorial optimization. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 429\u2013478. Springer, USA (1999)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Rao, S.: Small distortion and volume preserving embeddings for planar and euclidean metrics. In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, pp. 300\u2013306. ACM (1999)","DOI":"10.1145\/304893.304983"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-540-78773-0_18","volume-title":"LATIN 2008: Theoretical Informatics","author":"B Reed","year":"2008","unstructured":"Reed, B., Li, Z.: Optimization and recognition for K $$_\\text{5 }$$ -minor free graphs in linear time. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 206\u2013215. Springer, Heidelberg (2008)"},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","volume":"2","author":"P Seymour","year":"1981","unstructured":"Seymour, P.: Matroids and multicommodity flows. Eur. J. Comb. 2, 257\u2013290 (1981)","journal-title":"Eur. J. Comb."},{"key":"6_CR30","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"3","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. London Math. Soc. 3, 178\u2013192 (1981)","journal-title":"Proc. London Math. Soc."},{"key":"6_CR31","first-page":"192","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"DB Shmoys","year":"1997","unstructured":"Shmoys, D.B.: Cut problems and their application to divide-and-conquer. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 192\u2013235. PWS Publishing, Boston (1997)"},{"key":"6_CR32","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine eigenschaft der ebenen komplexe. Math. Ann. 114, 570\u2013590 (1937)","journal-title":"Math. Ann."},{"key":"6_CR33","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s10898-005-1649-y","volume":"34","author":"Q Wang","year":"2006","unstructured":"Wang, Q., Yang, X., Zhang, J.: A class of inverse dominant problems under weighted $$l_\\infty $$ norm and an improved complexity bound for Radzik\u2019s algorithm. J. Global Optim. 34, 551\u2013567 (2006)","journal-title":"J. Global Optim."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T10:51:57Z","timestamp":1498301517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}