The k-hop connected dominating set problem: hardness and polyhedra☆
References (14)
Max-leaves spanning tree is APX-hard for cubic graphs
J. of Discrete Algorithms
(2012)- et al.
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
(2008) - et al.
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
J. of Discrete Algorithms
(2010) - et al.
Vertex and edge covers with clustering properties: Complexity and algorithms
J. of Discrete Algorithms
(2009) - et al.
Improved methods for approximating node weighted steiner trees and connected dominating sets
Information and Computation
(1999) - et al.
Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey
Computer Communications
(2013) - et al.
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms
(2006)
There are more references available in the full text version of this article.
Cited by (9)
Structural parameters, tight bounds, and approximation for (k,r)-center
2019, Discrete Applied MathematicsThe Parameterized Complexity of Terminal Monitoring Set
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Solving the k-dominating set problem on very large-scale networks
2020, Computational Social NetworksTwo Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management
2019, Journal of Network and Systems ManagementDistributed Construction of D-Hop Connected Dominating Sets for Wireless Sensor Networks
2018, Proceedings - IEEE Global Communications Conference, GLOBECOMStructural parameters, tight bounds, and approximation for (k, r)-Center
2017, Leibniz International Proceedings in Informatics, LIPIcs
- ☆
Research supported by CNPq (Proc. 477203/2012-4, Proc. 456792/2014-7), FAPESP (Proc. 2013/03447-6) and MaCLinC project of NUMEC/USP. R.S. Coelho is supported by CAPES, P.F.S. Moura is supported by FAPESP (Proc. 2013/19179-0) and Y. Wakabayashi is partially supported by CNPq Grant (Proc. 303987/2010-3).
Copyright © 2015 Elsevier B.V. All rights reserved.