Abstract
Steiner connected dominating set (SCDS) is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and known to be NP-hard. This paper firstly modifies the SCDS algorithm of Guha and Khuller and achieves a worst case approximation ratio of (2+1/(m−1))H(min (D, k))+O(1), which outperforms the previous best result (c+1)H(min (D, k))+O(1) in the case of mge 1+1/(c−1), where c is the best approximation ratio for Steiner tree, D is the maximum degree of the graph, k is the cardinality of the set of required vertices, m is an optional integer satisfying 0≤ m ≤ min (D, k) and H is the harmonic function. This paper also proposes another approximation algorithm which is based on a greedy approach. The second algorithm can establish a worst case approximation ratio of 2ln (min (D, k))+O(1), which can also be improved to 2ln k if the optimal solution is greater than \(\frac{c\dot{e^{2c+1}}}{2(c+1)}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Garey M R, Johnson D S. Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
Alzoubi K M, Wan P-J, Frieder O. New distributed algorithm for connected dominating set in wireless ad hoc networks. In Proc. 35th HICSS, Hawaii, Jan. 7–10, 2002, pp.3849–3855.
Jia L, Rajaraman R, Suel T. An efficient distributed algorithm for constructing small dominating sets. In Proc. the Annual ACM Symposium on Principles of Distributed Computing, 2001, pp.33–42.
Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica, April 1998, 20(4): 374–387.
Wu J, Li H L. On calculating connected dominating set for networks. In Proc. the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 1999, pp.7–14.
Bharghavan V, Das B. Routing in ad hoc networks using minimum connected dominating sets. In Proc. IEEE Int. Conf. Communications'97, Montreal, June 1997, pp.376–380.
Wu Y-F, Xu Y-X, Chen G-L, Wang K. On the Construction of virtual multicast backbone for wireless ad hoc networks. In Proc. the First IEEE Int. Conf. Mobile Ad Hoc and Sensor Systems, Florida, USA, October, 2004, pp.294–303.
Karpinsky M, Zelikovsky A. New approximation algorithms for the Steiner tree problem. Technical Report, Electronic Colloquium on Computational Complexity: TR95–030, 1995.
Corman T, Leiserson C, Rivest R. Introduction to Algorithm. The MIT Press, 1989.
Berman P, Ramaiyer V. Improved approximation algorithms for the Steiner tree problem. J. Algorithm, 1994, 17: 381–408.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China under Grant No. 60173048 on “Research on Routing and Wavelength Assignment in WDM All-optical Networks”.
Rights and permissions
About this article
Cite this article
Wu, YF., Xu, YL. & Chen, GL. Approximation Algorithms for Steiner Connected Dominating Set. J Comput Sci Technol 20, 713–716 (2005). https://doi.org/10.1007/s11390-005-0713-x
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11390-005-0713-x