E. de Klerk, D.V. Pasechnik  Home/Search
Context Related
| ssor.twi.tudelft.nl/~deklerk...sos2a.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: ssor.twi.tudelft.nl/~de...publish (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Lov asz and Schrijver [10] showed how to formulate increasingly tight approximations of the stable set polytope of a graph by solving semide nite programs (SDP's) of increasing size (lift-andproject method). In this paper we present a similar idea. We show how the stability number can be computed as the solution of a conic linear program (LP) over the cone of copositive matrices. Subsequently, we show how to approximate the copositive cone ever more closely via linear or semide nite programs of ... (Update)
Similar documents based on text: More All
2.1: The maximal stable set problem: Copositive programming and.. - Krishnan (2001) (Correct)
0.8: Approximation Algorithms. Bibliography for Lectures 8,9,10 - Rabani (1995) (Correct)
0.8: Augmented Lagrange Duality and Lovász' Theta - Pinar (Correct)
BibTeX entry: (Update)
E. de Klerk, D.V. Pasechnik. Approximation of the stability number of a graph via copositive programming. Manuscript, Faculty of Information Technology and Systems, Delft University of Technology, The Netherlands, 2000. (Accepted for publication in SIAM Journal of Optimization.) http://citeseer.ist.psu.edu/deklerk01approximation.html More
@article{ klerk00approximation,
author = "E. de Klerk and D. Pasechnik",
title = "Approximation of the stability number of a graph via copositive programming",
journal="SIAM Journal on Optimization",
volume=12, pages="875--892",
year = "2002",
url = "citeseer.ist.psu.edu/deklerk01approximation.html" }
Citations (may not include all citations):415 Improved approximation algorithms for maximum cut and satisa.. - Goemans, Williamson - 1995
134 Geometric Algorithms and Combinatorial Optimization (context) - Gr, Lov et al. - 1988
104 Approximating maximum independent sets by excluding subgraph.. - Boppana, Halld - 1992
72 Cones of matrices and set{functions and 0-1 optimization (context) - Lov, Schrijver - 1991
56 the Shannon capacity of a graph (context) - Lov, On - 1979
15 A strengthened sdp relaxation via a second lifting for the m.. - Anjos, Wolkowicz - 1999
9 When does the positive semideniteness constraint help in lif.. (context) - Goemans, Tun - 2000
8 Some NP-complete problems in quadratic and linear programmin.. (context) - Murty, Kabadi - 1987
5 On copositive programming and standard quadratic optimizatio.. - Bomze, ur et al. - 2000
3 Structured Semidenite Programs and Semi-algebraic Geometry M.. (context) - Parillo - 2000
3 Clique is hard to approximate within jV 1 j (context) - Hastad - 1999
3 olya's Theorem with applications to polynomials positive on .. (context) - Powers, Reznick et al. - 2000
3 Maxima for graphs and a new proof of a theorem of Turan (context) - Motzkin, Straus - 1965
3 A comparison of the Delsarte and Lovasz bounds (context) - Schrijver - 1979
2 Copositive relaxation for general quadratic programming (context) - Quist, de Klerk et al. - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://ssor.twi.tudelft.nl/~deklerk/publish.html): More
On Convex Quadratic Approximation - den Hertog, de Klerk, Roos (2000) (Correct)
On Copositive Programming and Standard Quadratic.. - Bomze, Dür, de.. (2000) (Correct)
On semidefinite programming relaxations of (2+p)-SAT - de Klerk, van Maaren (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC