New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984): Difference between revisions

@@ Property / author @@
-Bruno Escoffier
@@ Property / author: Bruno Escoffier / rank @@
-Normal rank
@@ Property / author @@
+Bruno Escoffier
@@ Property / author: Bruno Escoffier / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-014-9549-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2141026984
@@ Property / OpenAlex ID: W2141026984 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerate and Measure: Improving Parameter Budget Management
+Normal rank
@@ Property / cites work @@
+Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
+Normal rank
@@ Property / cites work @@
+Improved approximation bounds for edge dominating set in dense graphs
+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 @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of edge dominating set problems
+Normal rank
@@ Property / cites work @@
+The importance of being biased
@@ Property / cites work: The importance of being biased / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized approximation of dominating set problems
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation via Fidelity Preserving Transformations
+Normal rank
@@ Property / cites work @@
+edge dominating set: Efficient Enumeration-Based Exact Algorithms
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms through enumerating maximal independent sets and other techniques
+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 @@
+Exact algorithms for edge domination
@@ Property / cites work: Exact algorithms for edge domination / rank @@
+Normal rank
@@ Property / cites work @@
+New parameterized algorithms for the edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Parameterized edge dominating set in graphs with degree bounded by 3
+Normal rank
@@ Property / cites work @@
+A Refined Exact Algorithm for Edge Dominating Set
@@ Property / cites work: A Refined Exact Algorithm for Edge Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank