A distributed approximation algorithm for the bottleneck connected dominating set problem.
Anurag VermaSergiy ButenkoPublished in: Optim. Lett. (2012)
Keyphrases
- dominating set
- dynamic programming
- worst case
- approximation ratio
- expectation maximization
- simulated annealing
- theoretical analysis
- similarity measure
- recognition algorithm
- k means
- learning algorithm
- np hard
- special case
- preprocessing
- computational complexity
- detection algorithm
- closed form
- approximation algorithms
- cost function
- computational cost
- supply chain
- optimal solution
- optimization algorithm
- mathematical model
- combinatorial optimization
- error bounds
- objective function