Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections withźthe Max-Cut Problem
Pages 63 - 76
Abstract
We study the sparsest cut problem when the "capacity-demand" graph is planar, and give a combinatorial algorithm. In this type of graphs there is an edge for each positive capacity and also an edge for each positive demand. We extend this result to graphs with no $$K_5$$ minor. We also show how to find a maximum concurrent flow in these two cases. We use ideas that had been developed for the max-cut problem, and show how to exploit the connections among these problems.
References
[1]
Arora, S., Lee, J., Naor, A.: Euclidean distortion and the sparsest cut. J. Am. Math. Soc. 21, 1---21 2008
[2]
Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM JACM 56, 5 2009
[3]
Barahona, F.: The max-cut problem on graphs not contractible to $$K_5$$. Oper. Res. Lett. 2, 107---111 1983
[4]
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---202. American Mathematical Society, Providence 1990
[5]
Barahona, F.: On cuts and matchings in planar graphs. Math. Program. 60, 53---68 1993
[6]
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300---343 1984
[7]
Cornuejols, G., Naddef, D., Pulleyblank, W.: The traveling salesman problem in graphs with 3-edge cutsets. J. ACM JACM 32, 383---410 1985
[8]
Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13, 492---498 1967
[9]
Edmonds, J., Johnson, E.L.: Matching, euler tours and the Chinese postman. Math. Program. 5, 88---124 1973
[10]
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399---404 1956
[11]
Gabow, H.N.: An efficient implementation of Edmonds' algorithm for maximum matching on graphs. J. ACM JACM 23, 221---234 1976
[12]
Günlük, O.: A new min-cut max-flow ratio for multicommodity flows. SIAM J. Discrete Math. 21, 1---15 2007
[13]
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---290. ACM 2013
[14]
Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4, 221---225 1975
[15]
Hong, S.-P., Choi, B.-C.: Polynomiality of sparsest cuts with fixed number of sources. Oper. Res. Lett. 35, 739---742 2007
[16]
Hu, T.C.: Multi-commodity network flows. Oper. Res. 11, 344---360 1963
[17]
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---690. ACM 1993
[18]
Klein, P., Rao, S., Agrawal, A., Ravi, R.: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica 15, 187---202 1995
[19]
Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Corporation, New York 1976
[20]
Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM JACM 46, 787---832 1999
[21]
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177---189 1979
[22]
Matula, D.W., Shahrokhi, F.: Sparsest cuts and bottlenecks in graphs. Discrete Appl. Math. 27, 113---123 1990
[23]
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---775. ACM 1993
[24]
Patel, V.: Determining edge expansion and other connectivity measures of graphs of bounded genus. SIAM J. Comput. 42, 1113---1131 2013
[25]
Plotkin, S., Tardos, É.: Improved bounds on the max-flow min-cut ratio for multicommodity flows. Combinatorica 15, 425---434 1995
[26]
Radzik, T.: Fractional combinatorial optimization. In: Du, D.-Z., Pardalos, P.M. eds. Handbook of Combinatorial Optimization, pp. 429---478. Springer, USA 1999
[27]
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---306. ACM 1999
[28]
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---215. Springer, Heidelberg 2008
[29]
Seymour, P.: Matroids and multicommodity flows. Eur. J. Comb. 2, 257---290 1981
[30]
Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. London Math. Soc. 3, 178---192 1981
[31]
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---235. PWS Publishing, Boston 1997
[32]
Wagner, K.: Über eine eigenschaft der ebenen komplexe. Math. Ann. 114, 570---590 1937
[33]
Wang, Q., Yang, X., Zhang, J.: A class of inverse dominant problems under weighted $$l_\infty $$ norm and an improved complexity bound for Radzik's algorithm. J. Global Optim. 34, 551---567 2006
Recommendations
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
We study the sparsest cut problem when the "capacity-demand" graph is planar, and give a combinatorial polynomial algorithm. In this type of graphs there is an edge for each positive capacity and also an edge for each positive demand. We extend this ...
Total domination in planar graphs of diameter two
MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
Weakly bipartite graphs and the Max-cut problem
A new class of graphs, called weakly bipartite graphs, is introduced. A graph is called weakly bipartite if its bipartite subgraph polytope coincides with a certain polyhedron related to odd cycle constraints. The class of weakly bipartite graphs ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 June 2016
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in