Such an idea is inspired by [9], in which a 5∕3-approximation algorithm was obtained for the minimum connected vertex cover problem (MinCVC) on those classes of graphs for which MinVC is polynomial-time solvable. Besides such an idea, due to the much more complicated structure of a CVC...
Our algorithm is based on a novel LP relaxation for this problem. This LP relaxation is obtained by adding knapsack cover inequalities to a natural LP relaxation of the problem. We show that this LP has integrality gap of $O(log r)$, where $r$ is the number of sets in the partition ...
For every fixed p≥2, p-Edge-Connected Vertex Cover admits a polynomial-time 2(p+1)-factor approximation algorithm. The proof of this theorem uses the notion of p-blocks which can be obtained from a Gomory-Hu tree. Unfortunately, this approach is not applicable to p-Connected Vertex Cover...
Mastrolilli, Vertex cover in graphs with locally few colors (2011), pp 498–509 D. Hochbaum, Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555–556 (1982) CrossRef About this Chapter Title Vertex Cover Problem—Revised Approximation ...
两种方法求Weighted Vertex Cover近似解
The vertex cover problem is a classical NP–complete problem for which the best worstcase approximation ratio is 2–o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to find approximate vertex covers for a lar...
In this paper we present a 2-approximation NC (and RNC) algorithm for connected vertex cover (and tree cover). The NC algorithm runs in O(log 2 n) time using O( Δ 2( m+ n)/log n) processors on an EREW-PRAM, while the RNC algorithm runs in O(log n) expected time using O(...
This paper studies the combination problem of parallel machine scheduling and the vertex cover problem. Wang and Cui developed a (3 2 m+1)-approximation algorithm for this problem [13], where m is the number of parallel machines. We reduce the approximation factors from 2.33 to 2.25 for m ...
approximation degreeheuristic algorithmMinimum vertex cover problem(Min-VC) on a graph is a NP-hard problem. The neighborhoods of a vertex are analyzed in this paper, and so are the information they hold for judging whether the vertex is belong to Min-VC or not. Then, the concept of Max-...
Vertex Cover Algorithm - Have you ever wondered about the placement of traffic cameras? That how they are efficiently placed without wasting too much budget from the government? The answer to that comes in the form of vertex-cover algorithm. The position