Abstract
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Alizadeh, “A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs,” ACM-SIAM Symposium on Discrete Algorithms, vol. 2, pp. 188–194, 1991.
N. Alon and N. Kahale, “Approximating the independence number via the theta-function,” Mathematical Programming, vol. 80, no. 3. pp. 253–264, 1998.
H.Y. Benson and R.J. Vanderbei, “Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming,” Mathematical Programming, vol. 95, no. 2, pp. 279–302, 2003.
S. Benson and Y. Ye, “Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation,” in Applications and Algorithms of Complementarity, M. Ferris and J. Pang (Eds.), Kluwer Academic Publishers, 2000, pp. 1–18.
C. Berge, “Färbung von graphen deren sämtliche beziehungsweise deren ungerade kreise starr sind (zusammenfassung),” Wissenschaftliche Zeitschrift, Martin Luther Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe, pp. 114–115, 1961.
I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, “The maximum clique problem,” in Handbook of Combinatorial Optimization (Supplement Volume A), D.-Z. Du and P.M. Pardalos (Eds.), Kluwer Academic, Boston, Massachusetts, U.S.A., 1999, pp. 1–74.
S. Burer, R.D.C. Monteiro, and Y. Zhang, “Maximum stable set formulations and heuristics based on continuous optimization,” Mathematical Programming, vol. 94, no.1, pp. 137–166, 2002.
S. Burer, R.D.C. Monteiro, and Y. Zhang, “Solving a class of semidefinite programs via nonlinear programming,” Mathematical Programming, vol. 93, no. 1, pp. 97–122, 2002.
M. Chudnovsky, G. Cornuejols, X. Liu, P. Seymour, and K. Vuskovic, “Cleaning for Bergeness,” Technical report, Princeton University, 2003.
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, “The strong perfect graph theorem,” Technical report, Princeton University, 2003.
M. Chudnovsky and P. Seymour, “Recognizing Berge graphs,” Technical report, Princeton University, 2003.
G. Cornuejols, X. Liu, and K. Vuskovic, “A polynomial algorithm for recognizing perfect graphs,” Technical report, Carnegie Mellon University, 2003.
U. Feige, “Randomized graph products, chromatic numbers, and the Lovász's theta function,” Combinatorica, vol. 17, no. 1, pp. 79–90, 1997.
M. Grötschel, L. Lovász, and A. Schrijver, “Polynomial algorithms for perfect graphs,” Annals of Discrete Mathematics, pp. 325–356, 1984.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, New York, 1988.
G. Gruber and F. Rendl, “Computational experience with stable set relaxations,” SIAM Journal on Optimization, vol. 13 no. 4, pp. 1014–1028, 2003.
J. Hastad, “Clique is hard to approximate within \(n^{1-\epsilon}\),” Acta Mathematica, vol. 182, no. 1, pp. 105–142, 1999.
C. Helmberg and F. Rendl, “A spectral bundle method for semidefinite programming,” SIAM Journal on Optimization, vol. 10, no. 3, pp. 673–696, 2000.
S. Hougardy, “Inclusions between classes of perfect graphs,” Technical report, Humboldt-Universität zu Berlin, 1998. Available at http://www.informatik.hu-berlin.de/~hougardy/paper/classes.html.
D.E. Knuth, “The sandwich theorem,” Electronic Journal of Combinatorics, vol. 1, no. 1, A1, pp. 1–48, 1994.
L. Lovász, “On the Shannon capacity of a graph,” IEEE Transactions on Information Theory, vol. 25, pp. 1–7, 1979.
L. Lovász and A. Schrijver, “Cones of matrices and set-functions and 0-1 optimization,” SIAM Journal on Optimization, vol. 1, no. 2, pp. 166–190, 1991.
J. Mycielski, “Sur le coloriage des graphes,” Colloq. Math., vol. 3, 1955.
T. Stephen and L. Tunçel, “On a representation of the matching polytope via semidefinite liftings,” Mathematics of Operations Research, vol. 24 no. 1, pp. 1–7, 1999.
R.H. Tütüncü, K.C. Toh, and M.J. Todd, “Solving semidefinite-quadratic-linear programs using SDPT3,” Mathematical Programming, vol. 95, pp. 189–217, 2003.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.
Rights and permissions
About this article
Cite this article
Yildirim, E.A., Fan-Orzechowski, X. On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function. Comput Optim Applic 33, 229–247 (2006). https://doi.org/10.1007/s10589-005-3060-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-005-3060-5