The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721): Difference between revisions

@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Max-leaves spanning tree is APX-hard for cubic graphs
+Normal rank
@@ Property / cites work @@
+Approximation hardness of dominating set problems in bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Q3579442
@@ Property / cites work: Q3579442 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Improved methods for approximating node weighted Steiner trees and connected dominating sets.
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of Minimal Dominating Sets and Variants
+Normal rank
@@ Property / cites work @@
+The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
+Normal rank
@@ Property / cites work @@
+Steiner trees, connected domination and strongly chordal graphs
+Normal rank