Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks.
Peng-Jun WanLixin WangF. Frances YaoPublished in: ICDCS (2008)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- set cover
- exact algorithms
- network design problem
- approximation ratio
- primal dual
- approximation schemes
- open shop
- randomized algorithms
- spanning tree
- precedence constraints
- np hardness
- network flow
- undirected graph
- approximation guarantees
- disjoint paths