Incremental Evaluation Improvements of The RSN Algorithm for the Minimum Connected Dominating Set Problem

This paper proposes some incremental evaluation improvements of the state-of-the-art meta-heuristic algorithm for the well known combinatorial optimization problem minimum connecting dominating set problem. Comparing to the original algorithm, the proposed one improves the neighborhood evaluation by using a vertices weighted objective function and a new initialization phase. The computational results demonstrate the efficiency of the proposed algorithm in terms of both solution quality and computational efficiency.