
52 ◾ Mobile Ad Hoc Networks: Current Status and Future Trends
3.2.2.4.2 Vertex Cover
A vertex cover is a subset of vertices of V that includes at least one of the vertices (u, v) in set E.
Vertex cover can be used for the facility location problem. Finding minimum vertex cover problem
is NP-complete. e weighted version of the problem works on a vertex weighted graph model and
aims to minimize the total cost of the set. Figure 3.17a shows a sample vertex cover, and Figure
3.17b shows a sample weighted vertex cover with gray-filled nodes.
One of the most important central methods for finding the weighted vertex cover is the pric-
ing method that ...