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 条

[41] A novel formulation of the max-cut problem and related algorithm
Yang, Qingzhi
Li, Yiyong
Huang, Pengfei
APPLIED MATHEMATICS AND COMPUTATION, 2020, 371
[42] A discrete dynamic convexized method for the max-cut problem
Lin, Geng
Zhu, Wenxing
ANNALS OF OPERATIONS RESEARCH, 2012, 196 (01) : 371 - 390
[43] NP-hardness of the Euclidean Max-Cut problem
Ageev, A. A.
Kel'manov, A. V.
Pyatkin, A. V.
DOKLADY MATHEMATICS, 2014, 89 (03) : 343 - 345
[44] Max-Cut Problem Implementation and Analysis on a Quantum Computer
Verghese, Ayaan
Byron, David
Amann, Andreas
Popovici, Emanuel
2022 33RD IRISH SIGNALS AND SYSTEMS CONFERENCE (ISSC), 2022,
[45] An ant colony algorithm for solving Max-cut problem
Gao, Lin
Zeng, Yan
Dong, Anguo
PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 18 (09) : 1173 - 1178
[46] Solving the Max-Cut Problem using Semidefinite Optimization
Orkia, Derkaoui
Ahmed, Lehireche
2016 4TH IEEE INTERNATIONAL COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST), 2016, : 768 - 772
[47] A NOTE ON LINE DIGRAPHS AND THE DIRECTED MAX-CUT PROBLEM
CHVATAL, V
EBENEGGER, C
DISCRETE APPLIED MATHEMATICS, 1990, 29 (2-3) : 165 - 170
[48] NP-hardness of the Euclidean Max-Cut problem
A. A. Ageev
A. V. Kel’manov
A. V. Pyatkin
Doklady Mathematics, 2014, 89 : 343 - 345
[49] A discrete dynamic convexized method for the max-cut problem
Geng Lin
Wenxing Zhu
Annals of Operations Research, 2012, 196 : 371 - 390
[50] One-third-integrality in the max-cut problem
Laurent, M
Poljak, S
MATHEMATICAL PROGRAMMING, 1995, 71 (01) : 29 - 50

← 1 2 3 4 5 →