A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network.

Lina Chen Xiaohui Huang Zhao Zhang

Published in: J. Comb. Optim. (2018)

Keyphrases

vertex cover
approximation algorithms
polynomial time approximation
wireless sensor networks
minimum cost
np hard
special case
worst case
error bounds
constant factor
approximation ratio
connected components
precedence constraints
shortest path
partial order
undirected graph
computational complexity