An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks (Extended Abstract).
Minh Hai NguyenMinh Hoàng HàDinh Thai HoangDiep N. NguyenEryk DutkiewiczThe-Trung TranPublished in: CSoNet (2019)
Keyphrases
- extended abstract
- dominating set
- detection algorithm
- dynamic programming
- search space
- computational complexity
- computationally efficient
- segmentation algorithm
- learning algorithm
- matching algorithm
- simulated annealing
- cost function
- particle swarm optimization
- np hard
- k means
- preprocessing
- scheduling problem
- combinatorial optimization
- connected dominating set
- mathematical model
- complex systems
- special case
- optimal solution
- objective function
- similarity measure