PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs.
Lidan FanZhao ZhangWei WangPublished in: J. Comb. Optim. (2011)
Keyphrases
- vertex cover
- approximation algorithms
- minimum cost
- polynomial time approximation
- constant factor
- undirected graph
- planar graphs
- spanning tree
- weighted graph
- np hard
- special case
- worst case
- directed graph
- edge weights
- sufficient conditions
- partial order
- error bounds
- connected components
- approximation guarantees
- graph theory
- precedence constraints
- graph structure
- shortest path
- scheduling problem