Cut polytopes of minor-free graphs

被引：0

作者：

Chimani, Markus ^{[1
]}

Juhnke-kubitzke, Martina ^{[1
]}

Nover, Alexander ^{[1
]}

Roemer, Tim ^{[1
]}

机构：

[1] Univ Osnabruck, Sch Math Comp Sci, Osnabruck, Germany

来源：

BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE | 2023年 / 66卷 / 01期

关键词：

Maximum cut; cut polytope; polyhedral study; facets; lattice polytope; combinatorial optimization; graph; MAX-CUT; FACETS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The cut polytope of a graph G is the convex hull of the indicator vectors of all cuts in G and is closely related to the MAxCUT problem. We give the facet-description of cut polytopes of K-3,K-3-minor-free graphs and introduce an algorithm solving MAxCUT on those graphs, which only requires the running time of planar MAxCUT. Moreover, starting a systematic geometric study of cut polytopes, we classify graphs admitting a simple or simplicial cut polytope.

引用

页码：97 / 112

页数：16

共 50 条

[1] Separator theorems for minor-free and shallow minor-free graphs with applications
Wulff-Nilsen, Christian
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2011, : 37 - 46
[2] Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
Wulff-Nilsen, Christian
2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 37 - 46
[3] Modularity of minor-free graphs
Lason, Michal
Sulkowska, Malgorzata
JOURNAL OF GRAPH THEORY, 2023, 102 (04) : 728 - 736
[4] On the choosability of H -minor-free graphs
Fischer, Olivier
Steiner, Raphael
COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (02) : 129 - 142
[5] The spectral radius of minor-free graphs☆
Chen, Ming-Zhu
Liu, A-Ming
Zhang, Xiao-Dong
EUROPEAN JOURNAL OF COMBINATORICS, 2024, 118
[6] A PTAS for subset TSP in minor-free graphs
Le, Hung
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2279 - 2298
[7] Minor-free graphs have light spanners
Borradaile, Glencora
Le, Hung
Wulff-Nilsen, Christian
2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 767 - 778
[8] A PTAS for subset TSP in minor-free graphs
Le, Hung
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2279 - 2298
[9] Normality of cut polytopes of graphs is a minor closed property
Ohsugi, Hidefumi
DISCRETE MATHEMATICS, 2010, 310 (6-7) : 1160 - 1166
[10] VC Set Systems in Minor-free (Di)Graphs and Applications
Le, Hung
Wulff-Nilsen, Christian
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5332 - 5360

← 1 2 3 4 5 →