For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Semidefinite Programming Relaxation for the Generalized Stable Set Problem
Tetsuya FUJIE Akihisa TAMURA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
semidefinite programming, integer programming, bidirected graphs, perfect graphs,
Full Text: PDF(166.2KB)>>
In this paper, we generalize the theory of a convex set relaxation for the maximum weight stable set problem due to Grotschel, Lovasz and Schrijver to the generalized stable set problem. We define a convex set which serves as a relaxation problem, and show that optimizing a linear function over the set can be done in polynomial time. This implies that the generalized stable set problem for perfect bidirected graphs is polynomial time solvable. Moreover, we prove that the convex set is a polytope if and only if the corresponding bidirected graph is perfect. The definition of the convex set is based on a semidefinite programming relaxation of Lovasz and Schrijver for the maximum weight stable set problem, and the equivalent representation using infinitely many convex quadratic inequalities proposed by Fujie and Kojima is particularly important for our proof.