Approximation of the Stability Number of a Graph via Copositive Programming
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 12 (4), 875-892
- https://doi.org/10.1137/s1052623401383248
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project ProcedureSIAM Journal on Optimization, 2002
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- On Copositive Programming and Standard Quadratic Optimization ProblemsJournal of Global Optimization, 2000
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Cones of Matrices and Set-Functions and 0–1 OptimizationSIAM Journal on Optimization, 1991
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965