Approximating edge dominating set in dense graphs (Q764308): Difference between revisions

@@ Property / cites work @@
+Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
+Normal rank
@@ Property / cites work @@
+Approximating the dense set-cover problem
@@ Property / cites work: Approximating the dense set-cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Subdense Instances of Covering Problems
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation bounds for edge dominating set in dense graphs
+Normal rank
@@ Property / cites work @@
+Connected vertex covers in dense graphs
@@ Property / cites work: Connected vertex covers in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of edge dominating set problems
+Normal rank
@@ Property / cites work @@
+Improved non-approximability results for minimum vertex cover with density constraints
+Normal rank
@@ Property / cites work @@
+Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Minimum Edge Dominating Sets
@@ Property / cites work: Minimum Edge Dominating Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921716
@@ Property / cites work: Q2921716 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
+Normal rank
@@ Property / cites work @@
+Q4395327
@@ Property / cites work: Q4395327 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank