Given a graph G=(V,E) with node weight w:V→R
+, the minimum weighted connected vertex cover problem (MWCVC) is to seek a subset of vertices of the graph with minimum total weight, such that for any edge of the graph, at least one endpoint of the edge is contained in the subset, and the subgraph induced by this subset is connected. In this paper, we study the problem on unit disk graph. A polynomial‐time approximation scheme (PTAS) for MWCVC is presented under the condition that the graph is c‐local.
