Exact algorithms for dominating set☆
Highlights
► We give the currently fastest exact algorithm for the Dominating Set problem. ► We obtain this algorithm by considering a series of branch-and-reduce algorithms. ► Each algorithm in the series is analysed using the measure and conquer approach. ► This analysis is used to find new rules for the next algorithm in the series. ► The result is an -time polynomial-space algorithm.
Keywords
Cited by (0)
- ☆
This paper is the first full description of our work from which a preliminary version appeared at the 25th International Symposium on Theoretical Aspects of Computer Science (STACS2008) [25]. In this paper, all running times are improved compared to this preliminary version by choosing a slightly better measure, similar to [7]. This leads to new and improved running times for the Dominating Set problem. Also, for the first time, we give full proofs of the running times of the algorithms obtained in the presented improvement series.