A Simple Heuristic for Minimum Connected Dominating Set in Graphs

  title={A Simple Heuristic for Minimum Connected Dominating Set in Graphs},
  author={P. Wan and Khaled M. Alzoubi and O. Frieder},
  journal={Int. J. Found. Comput. Sci.},
  • P. Wan, Khaled M. Alzoubi, O. Frieder
  • Published 2003
  • Mathematics, Computer Science
  • Int. J. Found. Comput. Sci.
  • Let α2(G), γ(G) and γc(G) be the 2-independence number, the domination number, and the connected domination number of a graph G respectively. Then α2(G) ≤ γ (G) ≤ γc(G). In this paper , we present a simple heuristic for Minimum Connected Dominating Set in graphs. When running on a graph G excluding Km (the complete graph of order m) as a minor, the heuristic produces a connected dominating set of cardinality at most 7α2(G) - 4 if m = 3, or at most if m ≥ 4. In particular, if running on a planar… CONTINUE READING
    21 Citations

    Topics from this paper

    CDS in Planar Graphs
    Computational Study on Dominating Set Problem of Planar Graphs
    • 4
    Approximation Algorithms for the Capacitated Domination Problem
    • 8
    • PDF
    CDS in General Graph
    Graph Domination, Coloring and Cliques in Telecommunications
    • 68
    • PDF
    CDS in Disk-Containment Graphs
    Capacitated Domination: Problem Complexity and Approximation Algorithms
    • 16
    • PDF
    Computational study on planar dominating set problem
    • 9
    Polynomial-time data reduction for dominating set
    • 216
    • PDF
    CDS in Unit Disk Graph


    Approximation algorithms for NP-complete problems on planar graphs
    • B. Baker
    • Mathematics, Computer Science
    • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
    • 1983
    • 918
    • PDF
    Simple heuristics for unit disk graphs
    • 501
    • PDF
    Unit disk graphs
    • 1,409
    On the hardness of approximating minimization problems
    • 659
    • PDF