Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Authors:
Yuri Faenza;Gianpaolo Oriolo;Gautier Stauffer
Affiliations:
Università di Padova, Italy;Università Tor Vergata, Roma, Italy;Bordeaux Institute of Mathematics, France
Venue:
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Year:
2012

Citing 4
Cited 0

A cutting plane algorithm for minimum perfect 2-matchings

Computing
Combinatorial optimization

Combinatorial optimization
A new algorithm for the maximum weighted stable set problem in claw-free graphs

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Branched polyhedral systems

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formulations and propose a new polytime algorithm for solving the separation problem for the stable set polytope of claw-free graphs. This routine combines a separation algorithm for the matching polytope due to Padberg and Rao and the solution of (moderate size) compact linear programs. Hence, it does not rely on the ellipsoid method and seems to be appropriate to be inserted in branch and cut frameworks for solving real world problems.