A Greedy Heuristic and Its Variants for Minimum Capacitated Dominating Set.
Anupama PotluriAlok SinghPublished in: IC3 (2012)
Keyphrases
- dominating set
- greedy heuristic
- facility location problem
- np hard
- approximation algorithms
- connected dominating set
- facility location
- greedy algorithm
- minimum weight
- knapsack problem
- minimum cost
- set cover
- optimal solution
- special case
- worst case analysis
- lower bound
- worst case
- network design problem
- branch and bound algorithm
- lagrangian relaxation
- network design
- lot sizing
- linear program
- scheduling problem