Minimum dominating sets of intervals on lines
We study the problem of computing minimum dominating sets of n intervals on lines in three cases: (1) the lines intersect at a single point, (2) all lines except one are parallel, and (3) one line with t weighted points on it and the minimum dominating set must maximize the weight sum of the weighted points covered. We propose polynomial-time algorithms for the first two problems, which are special cases of the minimum dominating set problem for path graphs which is known to be NP-hard. The third problem requires identifying the structure of minimum dominating sets of intervals on a line so as to be able to select one that maximizes the weight sum of the weighted points covered. Assuming that presorting has been performed, the first problem has an O(n) time solution, while the second and the third problems are solved by dynamic programming algorithms, requiring O(n log n) and O(n+t) time, respectively.
Unable to display preview. Download preview PDF.
- [Bra87]A. Brandtstaedt, The computational complexity of feedback vertex set, hamiltonian circuit, dominating set, steiner tree, and bandwidth on special perfect graphs, J. Inf. Process. Cybern., 23 (1987), pp. 471–477.Google Scholar
- [GT85]H. Gabow and R. Tarjan, A linear-time algorithm for a special case of disjoint set union, Journal of Computer and System Sciences, (1985), pp. 209–221.Google Scholar
- [Gol80]M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, 1980.Google Scholar
- [Tar83]R. Tarjan, Data structures and network algorithms, CBMS-NSF 44, SIAM, 1983.Google Scholar