On approximating (connected) 2-edge dominating set by a tree (Q1635808): Difference between revisions

@@ Property / cites work @@
+Experiments on data reduction for optimal domination in networks
+Normal rank
@@ Property / cites work @@
+Approximating the tree and tour covers of a graph
@@ Property / cites work: Approximating the tree and tour covers of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On min-max \(r\)-gatherings
@@ Property / cites work: On min-max \(r\)-gatherings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Approximability of the capacitated \(b\)-edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Enumerate and Measure: Improving Parameter Budget Management
+Normal rank
@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-domination and \(k\)-independence in graphs: A survey
+Normal rank
@@ Property / cites work @@
+Approximation hardness of edge dominating set problems
+Normal rank
@@ Property / cites work @@
+Algorithms and Models for the Web-Graph
@@ Property / cites work: Algorithms and Models for the Web-Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Connected dominating set. Theory and applications
@@ Property / cites work: Connected dominating set. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
+Normal rank
@@ Property / cites work @@
+edge dominating set: Efficient Enumeration-Based Exact Algorithms
+Normal rank
@@ Property / cites work @@
+The Curse of Connectivity: t-Total Vertex (Edge) Cover
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Q3691778
@@ Property / cites work: Q3691778 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691779
@@ Property / cites work: Q3691779 / rank @@
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the fault-tolerant connected dominating set in a general graph
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first search and the vertex cover problem
@@ Property / cites work: Depth-first search and the vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating edge dominating set in dense graphs
@@ Property / cites work: Approximating edge dominating set in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
+Normal rank
@@ Property / cites work @@
+On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
+Normal rank
@@ Property / cites work @@
+New parameterized algorithms for the edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank