Approximating vertex cover on dense graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
On the Minimum Hitting Set of Bundles Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms (TALG)
On hard instances of approximate vertex cover
ACM Transactions on Algorithms (TALG)
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved approximation bounds for edge dominating set in dense graphs
Theoretical Computer Science
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
Approximation and Online Algorithms
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A better approximation ratio for the vertex cover problem
ACM Transactions on Algorithms (TALG)
On the minimum hitting set of bundles problem
Theoretical 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
On the approximability of the vertex cover and related problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Inapproximability of hypergraph vertex cover and applications to scheduling problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the inapproximability of vertex cover on k-partite k-uniform hypergraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
New complexity results for the k-covers problem
Information Sciences: an International Journal
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
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
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the approximability of minimum topic connected overlay and its special instances
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
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
Approximation of self-stabilizing vertex cover less than 2
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A tight analysis of the maximal matching heuristic
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The multi-radius cover problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms (TALG)
On the approximability and hardness of minimum topic connected overlay and its special instances
Theoretical Computer Science
Improved approximation bounds for edge dominating set in dense graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Approximating vertex cover in dense hypergraphs
Journal of Discrete Algorithms
An edge-reduction algorithm for the vertex cover problem
Operations Research Letters
A primal-dual method for approximating tree cover with two weights
Discrete Optimization
On approximation of the vertex cover problem in hypergraphs
Discrete Optimization
Vertex cover in graphs with locally few colors
Information and Computation
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Hi-index | 0.01 |
We obtain improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs. We use semidefinite programming to relax the problems and introduce new} rounding techniques for these relaxations. On graphs with maximum degree at most $\Delta$, the algorithm achieves a performance ratio of $2-(1-o(1))\frac{2 \ln \ln \Delta}{\ln \Delta}$ for large $\Delta$, which improves the previously known ratio of $2-\frac{\log \Delta + O(1)}{\Delta}$ obtained by Halld{órsson and Radhakrishnan. Using similar techniques, we also present improved approximations for the vertex cover problem in hypergraphs. For k-uniform hypergraphs with n vertices, we achieve a ratio of $k-(1-o(1))\frac{k\ln \ln n}{\ln n}$ for large n, and for k-uniform hypergraphs with maximum degree at most $\Delta$ the algorithm achieves a ratio of $k-(1-o(1))\frac{k(k-1)\ln \ln \Delta}{\ln \Delta}$ for large $\Delta$. These results considerably improve the previous best ratio of $k(1-c/\Delta^\frac{1}{k-1})$ for bounded degree k-uniform hypergraphs, and $k(1-c/n^\frac{k-1}{k})$ for general k-uniform hypergraphs, both obtained by Krivelevich. Using similar techniques, we also obtain an approximation algorithm for the weighted independent set problem, matching a recent result of Halldorsson.