Improving minimum cost spanning trees by upgrading nodes
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
An Extension of the Nemhauser-Trotter Theorem to Generalized Vertex Cover with Applications
SIAM Journal on Discrete Mathematics
Optimizing mixing in pervasive networks: a graph-theoretic perspective
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Extension of the nemhauser and trotter theorem to generalized vertex cover with applications
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Optimizing mix-zone coverage in pervasive wireless networks
Journal of Computer Security - Research in Computer Security and Privacy: Emerging Trends
| Hi-index | 0.00 |
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contributed to the solution by the edge e if exactly i of its endpoints are in the solution. The cost of including a vertex v in the solution is c(v). A solution has cost that is equal to the sum of the vertex costs and the edge costs. The minimum generalized vertex cover problem is to compute a minimum cost set of vertices. We study the complexity of the problem with the costs d0(e) = 1, d1(e) = α and d2(e) = 0 ∀e ∈ E and c(v) = β∀v ∈ V, for all possible values of α and β. We also provide 2-approximation algorithms for the general case.