Skip to main content
Log in

Approximation Algorithms for Connected Dominating Sets

  • Published:
Algorithmica Aims and scope Submit manuscript

An Erratum to this article was published on 01 September 2007

Abstract.

The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex in the dominating set. We focus on the related question of finding a connected dominating set of minimum size, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication.

Two polynomial time algorithms that achieve approximation factors of 2H(Δ)+2 and H(Δ)+2 are presented, where Δ is the maximum degree and H is the harmonic function. This question also arises in relation to the traveling tourist problem, where one is looking for the shortest tour such that each vertex is either visited or has at least one of its neighbors visited. We also consider a generalization of the problem to the weighted case, and give an algorithm with an approximation factor of (c n +1) \ln n where c n ln k is the approximation factor for the node weighted Steiner tree problem (currently c n = 1.6103 ). We also consider the more general problem of finding a connected dominating set of a specified subset of vertices and provide a polynomial time algorithm with a (c+1) H(Δ) +c-1 approximation factor, where c is the Steiner approximation ratio for graphs (currently c = 1.644 ).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 22, 1996; revised February 28, 1997.

An erratum to this article is available at http://dx.doi.org/10.1007/s00453-007-9015-8.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guha, S., Khuller, S. Approximation Algorithms for Connected Dominating Sets . Algorithmica 20, 374–387 (1998). https://doi.org/10.1007/PL00009201

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009201

Navigation