Improved Approximation Algorithms for the Partial Vertex Cover Problem
نویسندگان
چکیده
منابع مشابه
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
In this paper, we consider the minimum unweighted Vertex Cover problem with Hard Capacity constraints (VCHC) on multigraphs and hypergraphs. Given a graph, the objective of VCHC is to find a smallest multiset of vertices that cover all edges, under the constraints that each vertex can only cover a limited number of incident edges, and the number of available copies of each vertex is bounded. Th...
متن کاملExact Algorithms for Generalizations of Vertex Cover
The NP-complete Vertex Cover problem has been intensively studied in the field of parameterized complexity theory. However, there exists only little work concerning important generalizations of Vertex Cover like Partial Vertex Cover, Connected Vertex Cover, and Capacitated Vertex Cover which are of high interest in theory as well as in real-world applications. So far research was mainly focused...
متن کاملApproximation Algorithms for Submodular Set Cover with Applications
The main problem considered is submodular set cover, the problem of minimizing a linear function under a nondecreasing submodular constraint, which generalizes both wellknown set cover and minimum matroid base problems. The problem is NP-hard, and two natural greedy heuristics are introduced along with analysis of their performance. As applications of these heuristics we consider various specia...
متن کاملDistributed Vertex Cover in Network Graphs
Vertex cover, a minimal set of nodes to cover all edges in a graph, is an abstraction of coverage problems in sensor networks, transportation networks, etc, and is a well-konwn NP-hard problem. Minimum weighted vertex cover (MWVC) problem asks for further minimizing the cumulative weight of a vertex cover. We present new distributed k-hop algorithms for MWVC problem with theoretical and practic...
متن کاملApproximation Algorithms for Partial Covering Problems (submission to Icalp 2001, Track A)
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example , in k-set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-set cover, if each element occurs in at most f sets, then we derive a primal-dual f-approxima...
متن کامل