Sciweavers

ESA
2003
Springer
124views Algorithms» more  ESA 2003»
14 years 5 months ago
The Minimum Generalized Vertex Cover Problem
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 contr...
Refael Hassin, Asaf Levin