A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph.
Decheng DaiChangyuan YuPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- dominating set
- connected dominating set
- facility location problem
- graph structure
- learning algorithm
- approximation algorithms
- k means
- approximation ratio
- weighted graph
- worst case
- neural network
- computational complexity
- constant factor
- linear programming
- search space
- expectation maximization
- convex hull
- search algorithm
- dynamic programming
- graph model
- np hard
- optimal solution
- graph based algorithm
- objective function
- lower bound