A local approximation algorithm for minimum dominating set problem in anonymous planar networks.
Wojciech WawrzyniakPublished in: Distributed Comput. (2015)
Keyphrases
- dominating set
- objective function
- detection algorithm
- search space
- np hard
- dynamic programming
- approximation ratio
- learning algorithm
- optimal solution
- worst case
- expectation maximization
- closed form
- connected dominating set
- polynomial time approximation
- facility location problem
- probabilistic model
- special case
- decision making