Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2015.12.004
@@ Property / DOI: 10.1016/j.dam.2015.12.004 / rank @@
-Normal rank
@@ Property / author @@
-Xiao-hui Huang
@@ Property / author: Xiao-hui Huang / rank @@
-Normal rank
@@ Property / author @@
+Xiao-hui Huang
@@ Property / author: Xiao-hui Huang / 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.1016/j.dam.2015.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2216743162
@@ Property / OpenAlex ID: W2216743162 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the weighted \(k\)-path vertex cover problem
@@ Property / cites work: On the weighted \(k\)-path vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+A unified approximation algorithm for node-deletion problems
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs
+Normal rank
@@ Property / cites work @@
+PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+The vertex cover \(P_3\) problem in cubic graphs
@@ Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2015.12.004
@@ Property / DOI: 10.1016/J.DAM.2015.12.004 / rank @@
+Normal rank