Algorithm and complexity of the two disjoint connected dominating sets problem on trees.
Xianliang LiuZishen YangWei WangPublished in: Appl. Math. Comput. (2018)
Keyphrases
- computational cost
- worst case
- learning algorithm
- experimental evaluation
- computational complexity
- theoretical analysis
- dynamic programming
- space complexity
- tree structure
- high accuracy
- objective function
- improved algorithm
- computationally efficient
- simulated annealing
- cost function
- significant improvement
- preprocessing
- optimization algorithm
- ant colony optimization
- times faster
- convergence rate
- search space
- particle swarm optimization
- evolutionary algorithm
- classification algorithm
- memory requirements
- binary tree