This article, "Approximation Algorithms for Connected Dominating Sets" by S. Guha and S. Khuller, was published in Algorithmica 20:4 (April 1998), pages 374–387, DOI 10.1007/PL00009201. The publisher has issued an erratum acknowledging that Samir Khuller is also a co-author of the article. The article should be cited with all three author names: S. Guha, S. Khuller, and Samir Khuller. The paper presents approximation algorithms for connected dominating sets, which are fundamental concepts in graph theory with applications in network design and communication networks. The authors propose algorithms that provide near-optimal solutions for finding connected dominating sets in graphs. The work contributes to the field of approximation algorithms by offering efficient methods to approximate the minimum connected dominating set problem. The algorithms are analyzed in terms of their performance guarantees, providing bounds on the approximation ratios. The paper is significant for its contribution to the understanding of connected dominating sets and the development of efficient approximation techniques for this problem. The correction highlights the importance of accurately citing all co-authors in academic publications. The authors' work is a valuable resource for researchers and practitioners in computer science and related fields.This article, "Approximation Algorithms for Connected Dominating Sets" by S. Guha and S. Khuller, was published in Algorithmica 20:4 (April 1998), pages 374–387, DOI 10.1007/PL00009201. The publisher has issued an erratum acknowledging that Samir Khuller is also a co-author of the article. The article should be cited with all three author names: S. Guha, S. Khuller, and Samir Khuller. The paper presents approximation algorithms for connected dominating sets, which are fundamental concepts in graph theory with applications in network design and communication networks. The authors propose algorithms that provide near-optimal solutions for finding connected dominating sets in graphs. The work contributes to the field of approximation algorithms by offering efficient methods to approximate the minimum connected dominating set problem. The algorithms are analyzed in terms of their performance guarantees, providing bounds on the approximation ratios. The paper is significant for its contribution to the understanding of connected dominating sets and the development of efficient approximation techniques for this problem. The correction highlights the importance of accurately citing all co-authors in academic publications. The authors' work is a valuable resource for researchers and practitioners in computer science and related fields.