Abstract
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.
Research partially supported by RGC CER grant HKUST 190/93E.
Research done when the author was with the Department of Computer Science, Hong Kong University of Science and Technology.
Research done while visiting the Department of Computer Science, Hong Kong University of Science and Technology.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bertossi and A. Gori, Total domination and irredundance in weighted interval graphs, SIAM J. Discrete Math., 3 (1988), pp. 317–327.
K. Booth and J. Johnson, Dominating sets in chordal graphs, SIAM Journal on Computing, 11 (1982), pp. 191–199.
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.
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.
M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, 1980.
E. McCreight, Priority search trees, SIAM Journal on Computing, 14 (1985), pp. 257–276.
G. Ramalingam and P. Rangan, A unified approach to domination problems on interval graphs, Information Processing Letters, 27 (1988), pp. 271–274.
R. Tarjan, Data structures and network algorithms, CBMS-NSF 44, SIAM, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, SW., Kaminski, M., Zaks, S. (1995). Minimum dominating sets of intervals on lines. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030873
Download citation
DOI: https://doi.org/10.1007/BFb0030873
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive