Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number
The classic stable set problem asks to find a maximum cardinality set of pairwise non adjacent vertices in an undirected graph G. This problem is NP hard to approximate with factor n^{1 epsilon} for any constant epsilon>0 [Hastad/Acta Mathematica/1996; Zuckerman/STOC/2006] where n is the number of vertices, and therefore there is no hope for good approximations in the general case. We study the stable set problem when restricted to graphs with bounded odd cycle packing number ocp(G) possibly by a function of n. This is the largest number of vertex disjoint odd cycles in G. Equivalently, it is the logarithm of the largest absolute value of a sub determinant of the edge node incidence matrix A_G of G. Hence, if A_G is totally unimodular, then ocp(G)=0. Therefore, ocp(G) is a natural distance measure of A_G to the set of totally unimodular matrices on a scale from 1 to n/3. When ocp(G)=0, the graph is bipartite and it is well known that stable set can be solved in polynomial time. Our results imply that the odd cycle packing number indeed strongly influences the approximability of stable set. More precisely, we obtain a polynomial time approximation scheme for graphs with ocp(G)=o(n/log(n) and an alpha approximation algorithm for any graph where alpha smoothly increases from a constant to n as ocp(G) grows from O(n/log(n) to n/3. On the hardness side, we show that, assuming the exponential time hypothesis, stable set cannot be solved in polynomial time if ocp(G)=Omega(log^{1+epsilon}(n) for some epsilon>0. Finally, we generalize a theorem by Gyori et al. [Gyori et al./Discrete Mathematics/1997] and show that graphs without odd cycles of small weight can be made bipartite by removing a small number of vertices. This allows us to extend some of our above results to the weighted stable set problem.
FSTTCS