On approximability of the independent/connected edge dominating set problems (Q1603390): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+Q3337224
@@ Property / cites work: Q3337224 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753930
@@ Property / cites work: Q2753930 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Q4247267
@@ Property / cites work: Q4247267 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the minimum independent dominating set
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Q2753739
@@ Property / cites work: Q2753739 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252355
@@ Property / cites work: Q4252355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952699
@@ Property / cites work: Q4952699 / 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 @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1603390