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 条

[21] A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs
Le, Hung
Zheng, Baigong
COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 375 - 386
[22] Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs
Liu, Pengcheng
Zhang, Zhao
Ran, Yingli
Huang, Xiaohui
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2024, 34 (03) : 180 - 192
[23] Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
Kawarabayashi, Ken-Ichi
Klein, Philip N.
Sommer, Christian
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6755 LNCS (PART 1): : 135 - 146
[24] Robust Algorithms for MAX INDEPENDENT SET on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
Magen, Avner
Moharrami, Mohammad
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2009, 5687 : 258 - +
[25] Low Treewidth Embeddings of Planar and Minor-Free Metrics
Filtser, Arnold
Hung Le
2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 1081 - 1092
[26] Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Chang, Hsien-Chih
Conroy, Jonathan
Le, Hung
Milenkovic, Lazar
Solomon, Shay
Than, Cuong
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5300 - 5331
[27] Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
Kawarabayashi, Ken-ichi
Klein, Philip N.
Sommer, Christian
AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 135 - 146
[28] Local certification of graph decompositions and applications to minor-free classes ☆
Bousquet, Nicolas
Feuilloley, Laurent
Pierron, Theo
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 193
[29] Generalized cut and metric polytopes of graphs and simplicial complexes
Michel Deza
Mathieu Dutour Sikirić
Optimization Letters, 2020, 14 : 273 - 289
[30] Generalized cut and metric polytopes of graphs and simplicial complexes
Deza, Michel
Sikiric, Mathieu Dutour
OPTIMIZATION LETTERS, 2020, 14 (02) : 273 - 289

← 1 2 3 4 5 →