An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.
Chong Jye RheeY. Daniel LiangSudarshan K. DhallS. LakshmivarahanPublished in: SIAM J. Comput. (1996)
Keyphrases
- dominating set
- minimum weight
- facility location problem
- connected dominating set
- greedy heuristic
- minimum spanning tree
- graph structure
- spanning tree
- convergence rate
- learning algorithm
- probabilistic model
- maximum cardinality
- graph theory
- worst case
- dynamic programming
- randomized algorithm
- np hard
- optimal solution
- particle swarm optimization
- average case
- computational complexity