Approximating the Vertex Cover Problem by Selection of Nodes of Maximum Degrees for use in Wireless Sensor Networks.

Published in: FCS (2008)

Keyphrases

vertex cover
wireless sensor networks
node selection
sensor nodes
planar graphs
approximation algorithms
sensor networks
energy consumption
partial order
optimality criterion
routing algorithm
special case
directed graph
minimum cost
undirected graph
polynomial time approximation