Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568): 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.1007/978-3-540-74839-7_20
+Normal rank
@@ Property / OpenAlex ID @@
+W1629870200
@@ Property / OpenAlex ID: W1629870200 / rank @@
+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 @@
+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 @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex and edge covers with clustering properties: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximations for tour and tree covers
@@ Property / cites work: Improved approximations for tour and tree covers / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
+Normal rank
@@ Property / cites work @@
+Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
+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 @@
+On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3508568