On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
From MaRDI portal
Publication:2456357
DOI10.1016/j.tcs.2007.05.025zbMath1124.68082OpenAlexW2011806775MaRDI QIDQ2456357
My T. Thai, Ning Zhang, Xiaochun Xu, Ravi Tiwari
Publication date: 18 October 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.025
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (16)
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ On approximating (connected) 2-edge dominating set by a tree ⋮ Approximating \(k\)-connected \(m\)-dominating sets ⋮ Heuristics for \(k\)-domination models of facility location problems in street networks ⋮ A greedy algorithm for the fault-tolerant connected dominating set in a general graph ⋮ Research on gateway deployment of WMN based on maximum coupling subgraph and PSO algorithm ⋮ On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ Routing-efficient CDS construction in disk-containment graphs ⋮ Approximating k-Connected m-Dominating Sets ⋮ Partial domination - the isolation number of a graph ⋮ On Approximating (Connected) 2-Edge Dominating Set by a Tree ⋮ A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem ⋮ An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
Cites Work
This page was built for publication: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
