A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.
Donghyun KimZhao ZhangXianyue LiWei WangWeili WuDing-Zhu DuPublished in: IEEE Trans. Mob. Comput. (2010)
Keyphrases
- theoretical analysis
- computational complexity
- np hard
- learning algorithm
- computational cost
- dynamic programming
- objective function
- preprocessing
- detection algorithm
- efficient computation
- cost function
- optimal solution
- worst case
- optimization algorithm
- segmentation algorithm
- particle swarm optimization
- graph isomorphism
- graph model
- clustering method
- similarity measure
- expectation maximization
- probabilistic model
- genetic algorithm
- k means
- search space