The vertex k-cut problem

被引：12

作者：

Cornaz, Denis ^{[1
]}

Furini, Fabio ^{[1
]}

Lacroix, Mathieu ^{[2
]}

Malaguti, Enrico ^{[3
]}

Mahjoub, A. Ridha ^{[1
]}

Martin, Sebastien ^{[4
]}

机构：

[1] Univ Paris 09, PSL, CNRS, LAMSADE UMR 7243, F-75775 Paris 16, France

[2] Univ Paris 13, Sorbonne Paris Cite, LIPN, CNRS,UMR 7030, Ave JB Clement, F-93430 Villetaneuse, France

[3] Univ Bologna, DEI, Viale Risorgimento 2, I-40136 Bologna, Italy

[4] Univ Lorraine, LCOMS, F-57045 Metz, France

来源：

DISCRETE OPTIMIZATION | 2019年 / 31卷

关键词：

Vertex cut; Mixed-integer programming models; Branch and Price; Exact algorithms; SEPARATOR PROBLEM; ALGORITHM; COMPLEXITY;

D O I：

10.1016/j.disopt.2018.07.003

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Given an undirected graph G = (V, E), a vertex k-cut of G is a vertex subset of V the removing of which disconnects the graph in at least k components. Given a graph G and an integer k >= 2, the vertex k-cut problem consists in finding a vertex k-cut of G of minimum cardinality. We first prove that the problem is NP-hard for any fixed k >= 3. We then present a compact formulation, and an extended formulation from which we derive a column generation and a branching scheme. Extensive computational results prove the effectiveness of the proposed methods. (C) 2018 Elsevier B.V. All rights reserved.

引用

页码：8 / 28

页数：21

共 50 条

[41] LP RELAXATION AND TREE PACKING FOR MINIMUM k-CUT
Chekuri, Chandra
Quanrud, Kent
Xu, Chao
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (02) : 1334 - 1353
[42] The Karger-Stein Algorithm Is Optimal for k-Cut
Gupta, Anupam
Lee, Euiwoong
Li, Jason
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 473 - 484
[43] Optimal Coloring Strategies for the Max k-Cut Game
Garuglieri, Andrea
Madeo, Dario
Mocenni, Chiara
Palma, Giulia
Rinaldi, Simone
MATHEMATICS, 2024, 12 (04)
[44] Computing program modularizations using the k-cut method
Jermaine, Christopher
Reverse Engineering - Working Conference Proceedings, 1999, : 224 - 234
[45] MAX k-CUT and approximating the chromatic number of random graphs
Coja-Oghlan, A
Moore, C
Sanwalani, V
RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (03) : 289 - 322
[46] Native measurement-based quantum approximate optimization algorithm applied to the Max K-Cut problem
Proietti, Massimiliano
Cerocchi, Filippo
Dispenza, Massimiliano
PHYSICAL REVIEW A, 2022, 106 (02)
[47] Improved approximation algorithms for MAX k-CUT and MAX BISECTION
Frieze, A
Jerrum, M
ALGORITHMICA, 1997, 18 (01) : 67 - 81
[48] An FPT Algorithm Beating 2-Approximation for k-Cut
Gupta, Anupam
Lee, Euiwoong
Li, Jason
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2821 - 2837
[49] K-cut quartz SAW resonators for stable frequency sources
Takagi, M
Momosaki, E
Yamakita, M
Oura, N
IEEE TRANSACTIONS ON ULTRASONICS FERROELECTRICS AND FREQUENCY CONTROL, 1998, 45 (02) : 328 - 337
[50] Breaking the nk Barrier for Minimum k-Cut on Simple Graphs
He, Zhiyang
Li, Jason
PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 131 - 136

← 1 2 3 4 5 →