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 条

[1] Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Baiou, Mourad
Barahona, Francisco
MATHEMATICAL PROGRAMMING, 2018, 172 (1-2) : 59 - 75
[2] Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Mourad Baïou
Francisco Barahona
Mathematical Programming, 2018, 172 : 59 - 75
[3] Graphs with a small max-cut
Delorme, C
Favaron, O
UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
[4] MAX-CUT IN CIRCULANT GRAPHS
POLJAK, S
TURZIK, D
DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
[5] A probabilistic result for the max-cut problem on random graphs
Beck, A
Teboulle, M
OPERATIONS RESEARCH LETTERS, 2000, 27 (05) : 209 - 214
[6] Partitioning planar graphs: a fast combinatorial approach for max-cut
F. Liers
G. Pardella
Computational Optimization and Applications, 2012, 51 : 323 - 344
[7] Partitioning planar graphs: a fast combinatorial approach for max-cut
Liers, F.
Pardella, G.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 51 (01) : 323 - 344
[8] On the max-cut of sparse random graphs
Gamarnik, David
Li, Quan
RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
[9] EIGENVALUES AND THE MAX-CUT PROBLEM
MOHAR, B
POLJAK, S
CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (02) : 343 - 352
[10] MAX-CUT on Samplings of Dense Graphs
Fakcharoenphol, Jittat
Vajanopath, Phanu
2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,

← 1 2 3 4 5 →