Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem

被引：0
|
作者：
Baiou, Mourad [1 ]
Barahona, Francisco [2 ]
机构：
[1] Univ Clermont II, CNRS, Campus Cezeaux BP 125, F-63173 Aubiere, France
[2] IBM TJ Watson Res Ctr, Yorktown Hts, NY 10589 USA
来源：
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016 | 2016年 / 9682卷
关键词：
Sparsest cut; Maximum concurrent flow; Planar graphs; Max-cut; MULTICOMMODITY FLOWS; ALGORITHM; RATIO;
D O I：
10.1007/978-3-319-33461-5_6
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：63 / 76
页数：14
相关论文
共 50 条
  • [21] ALGORITHMS FOR A CLASS OF MIN-CUT AND MAX-CUT PROBLEM
    GONZALEZ, TF
    MURAYAMA, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 97 - 105
  • [22] An exact algorithm for MAX-CUT in sparse graphs
    Della Croce, F.
    Kaminski, M. J.
    Paschos, V. Th.
    OPERATIONS RESEARCH LETTERS, 2007, 35 (03) : 403 - 408
  • [23] Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs
    Dahn, Christine
    Kriege, Nils M.
    Mutzel, Petra
    Schilling, Julian
    THEORETICAL COMPUTER SCIENCE, 2021, 852 : 172 - 184
  • [24] A hierarchical social metaheuristic for the Max-Cut problem
    Duarte, A
    Fernández, F
    Sánchez, A
    Sanz, A
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3004 : 84 - 94
  • [25] Cutting plane algorithm for the max-cut problem
    de Simone, C.
    Rinaldi, G.
    Optimization Methods and Software, 1994, 3 (1-3) : 195 - 214
  • [26] Advanced Scatter Search for the Max-Cut Problem
    Marti, Rafael
    Duarte, Abraham
    Laguna, Manuel
    INFORMS JOURNAL ON COMPUTING, 2009, 21 (01) : 26 - 38
  • [27] NODE AND EDGE RELAXATIONS OF THE MAX-CUT PROBLEM
    POLJAK, S
    RENDL, F
    COMPUTING, 1994, 52 (02) : 123 - 137
  • [28] Breakout Local Search for the Max-Cut problem
    Benlic, Una
    Hao, Jin-Kao
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (03) : 1162 - 1173
  • [29] On greedy construction heuristics for the MAX-CUT problem
    Kahruman, Sera
    Kolotoglu, Elif
    Butenko, Sergiy
    Hicks, Illya V.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2007, 3 (03) : 211 - 218
  • [30] Branch and Cut based on the volume algorithm:: Steiner trees in graphs and Max-cut
    Barahona, Francisco
    Ladanyi, Laszlo
    RAIRO-OPERATIONS RESEARCH, 2006, 40 (01) : 53 - 73
12345