The k-separator problem : polyhedra, complexity and approximation results - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2015

The k-separator problem : polyhedra, complexity and approximation results

Résumé

Given a vertex-weighted undirected graph G=(V,E,w) and a positive integer k, we consider the k-separator problem: it consists in finding a minimum-weight subset of vertices whose removal leads to a graph where the size of each connected component is less than or equal to k. We show that this problem can be solved in polynomial time for some graph classes including bounded treewidth, mK2-free, (G1,G2,G3,P6)-free, interval-filament, asteroidal triple-free, weakly chordal, interval and circular-arc graphs. Polyhedral results with respect to the convex hull of the incidence vectors of k-separators are reported. Approximation algorithms are also presented
Fichier non déposé

Dates et versions

hal-01262822 , version 1 (27-01-2016)

Identifiants

Citer

Walid Ben-Ameur, Mohamed Ahmed Mohamed Sidi, José Neto. The k-separator problem : polyhedra, complexity and approximation results. Journal of Combinatorial Optimization, 2015, 29 (1), pp.276 - 307. ⟨10.1007/s10878-014-9753-x⟩. ⟨hal-01262822⟩
128 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More