The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
SIAM Journal on Discrete Mathematics
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On semidefinite programming relaxations for graph coloring and vertex cover
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Vertex cover resists SDPs tightened by local hypermetric inequalities
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
Near-optimal distortion bounds for embedding doubling spaces into L1
Proceedings of the forty-third annual ACM symposium on Theory of computing
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the analysis of the immune-inspired B-cell algorithm for the vertex cover problem
ICARIS'11 Proceedings of the 10th international conference on Artificial immune systems
Strong and weak edges of a graph and linkages with the vertex cover problem
Discrete Applied Mathematics
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász-Schrijver Hierarchy
SIAM Journal on Computing
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Approximating vertex cover in dense hypergraphs
Journal of Discrete Algorithms
Graph orientations optimizing the number of light or heavy vertices
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Vertex cover in graphs with locally few colors
Information and Computation
Comparable dependencies over heterogeneous data
The VLDB Journal — The International Journal on Very Large Data Bases
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Analytical models for risk-based intrusion response
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
We reduce the approximation factor for the vertex cover to 2 − Θ (1/&sqrt;logn) (instead of the previous 2 − Θ ln ln n/2ln n obtained by Bar-Yehuda and Even [1985] and Monien and Speckenmeyer [1985]). The improvement of the vanishing factor comes as an application of the recent results of Arora et al. [2004] that improved the approximation factor of the sparsest cut and balanced cut problems. In particular, we use the existence of two big and well-separated sets of nodes in the solution of the semidefinite relaxation for balanced cut, proven by Arora et al. [2004]. We observe that a solution of the semidefinite relaxation for vertex cover, when strengthened with the triangle inequalities, can be transformed into a solution of a balanced cut problem, and therefore the existence of big well-separated sets in the sense of Arora et al. [2004] translates into the existence of a big independent set.