We call this the Knapsack Partition Vertex Cover problem. We give an O(logr) approximation algorithm for this problem as well.doi:10.1016/j.tcs.2014.04.006Bera, Suman K.Gupta, ShalmoliKumar, AmitRoy, SambuddhaElsevier B.V.Theoretical Computer Science...
This paper is aimed to present the solution to vertex cover problem by means of an approximation solution. As it is NP complete problem, we can have an approximate time algorithm to solve the vertex cover problem. We will modify the algorithm to have an algorithm which can be solved in ...
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...
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in \\(({\\it \\Delta}+1)^2\\) synchronous communication rounds, where \\({\\it \\Delta}\\) is the maximum degree of the graph. For \\({\\it \\De...
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem we introduce a meta-heuristic based upon the Ant Colony Optimization (ACO) approach, to find approximate solutions to the minimum weight vertex cover proble... SHYONG JIAN SHYU,PENG-YENG YIN,BERTRAND M.T. LIN - 《...
An iterative rounding 2-approximation algorithm for thek-partial vertex cover problemAn iterative rounding 2-approximation algorithm for thek-partial vertex cover problemdoi:10.1007/s10255-014-0282-2approximation algorithmiterative roundingk-partial vertex covercombinatorial...
Divide-and-Conquer Approximation Algorithm for Vertex Cover The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is $2-o(1)$. In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ra...
Vertex cover problem is a famous combinatorial problem, which its complexity has been heavily studied over the years and it is known that there is not any mathematical programming formulation that approximates it better than , while a -approximation for it can be trivially obtained. In this paper...
两种方法求Weighted Vertex Cover近似解
The problem is known to be NP-hard and to be at least as hard to approximate as the vertex cover problem is. While several 2-approximation NC algorithms are known for vertex cover, whether unweighted or weighted, no parallel algorithm with guaranteed approximation is known for connected vertex...