A primal approach to the stable set problem

Abstract

We present a new “primal” algorithm for the stable set problem. It is based on a purely combinatorial construction that can transform every graph into a perfect graph by replacing nodes with sets of new nodes. The transformation is done in such a way that every stable set in the perfect graph corresponds to a stable set in the original graph. The algorithm keeps a formulation of the stable set problem in a simplex-type tableau whose associated basic feasible solution is the incidence vector of the best known stable set. The combinatorial graph transformations are performed by substitutions in the generators of the feasible region. Each substitution cuts off a fractional neighbor of the current basic feasible solution. We show that “dual-type” polynomial-time separation algorithms carry over to our “primal” setting. Eventually, either a non-degenerate pivot leading to an integral basic feasible solution is performed, or the optimality of the current solution is proved.