Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936): 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.1016/j.jda.2009.01.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2009816066
@@ Property / OpenAlex ID: W2009816066 / 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 @@
+Local search for the minimum label spanning tree problem with bounded color classes.
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+A new multilayered PCP and the hardness of hypergraph vertex cover
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4093489
@@ Property / cites work: Q4093489 / rank @@
+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 for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Complexity of the minimum-length corridor problem
@@ Property / cites work: Complexity of the minimum-length corridor problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / 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 @@
+Optimization, approximation, and complexity classes
+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 @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Non-approximability results for optimization problems on bounded degree instances
+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:2266936