A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028): Difference between revisions

@@ 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.1016/j.tcs.2012.12.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2094388041
@@ Property / OpenAlex ID: W2094388041 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover Approximations on Random Graphs
@@ Property / cites work: Vertex Cover Approximations on Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+One for the price of two: a unified approach for approximating covering problems
+Normal rank
@@ Property / cites work @@
+On approximation properties of the Independent set problem for degree 3 graphs
+Normal rank
@@ Property / cites work @@
+An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
+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 @@
+Combining Two Worlds: Parameterised Approximation for Vertex Cover
+Normal rank
@@ Property / cites work @@
+Fixed-parameter approximation: conceptual framework and approximability results
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Refined memorization for vertex cover
@@ Property / cites work: Refined memorization for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
+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 @@
+On Parameterized Approximability
@@ Property / cites work: On Parameterized Approximability / rank @@
+Normal rank
@@ Property / cites work @@
+MAX SAT approximation beyond the limits of polynomial-time approximation
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Kernels for the Vertex Cover Problem on the Preferred Attachment Model
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Hardness results for approximating the bandwidth
@@ Property / cites work: Hardness results for approximating the bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation via Fidelity Preserving Transformations
+Normal rank
@@ Property / cites work @@
+Searching Trees: An Essay
@@ Property / cites work: Searching Trees: An Essay / rank @@
+Normal rank
@@ Property / cites work @@
+Measure and conquer
@@ Property / cites work: Measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum-Minimum Sätze über Graphen
@@ Property / cites work: Maximum-Minimum Sätze über Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is good: Approximating independent sets in sparse and bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Efficient bounds for the stable set, vertex cover and set packing problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921716
@@ Property / cites work: Q2921716 / rank @@
+Normal rank
@@ Property / cites work @@
+A better approximation ratio for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+A Fine-grained Analysis of a Simple Independent Set Algorithm
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251072
@@ Property / cites work: Q4251072 / rank @@
+Normal rank
@@ Property / cites work @@
+On efficient fixed-parameter algorithms for weighted vertex cover
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Confronting hardness using a hybrid approach
@@ Property / cites work: Confronting hardness using a hybrid approach / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Vertex Cover in Graphs with Maximum Degree 3
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:392028