Approximation Algorithms for Steiner Connected Dominating Set.
Ya-feng WuYinlong XuGuo-Liang ChenPublished in: J. Comput. Sci. Technol. (2005)
Keyphrases
- approximation algorithms
- connected dominating set
- dominating set
- facility location problem
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- constant factor
- network design problem
- set cover
- open shop
- approximation ratio
- np hardness
- randomized algorithms
- precedence constraints
- undirected graph
- disjoint paths
- genetic algorithm
- approximation schemes
- search space
- lower bound
- search algorithm