Improved Upper Bounds for Partial Vertex Cover

Authors:
Joachim Kneis;Alexander Langer;Peter Rossmanith
Affiliations:
Dept. of Computer Science, RWTH Aachen University, Germany;Dept. of Computer Science, RWTH Aachen University, Germany;Dept. of Computer Science, RWTH Aachen University, Germany
Venue:
Graph-Theoretic Concepts in Computer Science
Year:
2008

Citing 13
Cited 5

Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica
Color-coding

Journal of the ACM (JACM)
Using homogenous weights for approximating the partial cover problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Approximation Algorithms for the Partial Vertex Cover Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing small partial coverings

Information Processing Letters
Approximation algorithms for partial covering problems

Journal of Algorithms
Partial vs. Complete Domination: t-Dominating Set

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Parameterized complexity of generalized vertex cover problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Random separation: a new method for solving fixed-cardinality optimization problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Intuitive algorithms and t-vertex cover

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

The curse of connectivity: t-total vertex (edge) cover

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Subexponential algorithms for partial cover problems

Information Processing Letters
Parameterized reductions and algorithms for another vertex cover generalization

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

Theoretical Computer Science
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Partial Vertex Cover problem is to decide whether a graph contains at most k nodes covering at least t edges. We present deterministic and randomized algorithms with run times of O *(1.396 t ) and O *(1.2993 t ), respectively. For graphs of maximum degree three, we show how to solve this problem in O *(1.26 t ) steps. Finally, we give an O *(3 t ) algorithm for Exact Partial Vertex Cover , which asks for at most k nodes covering exactly t edges.