Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (Q2942448)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem |
scientific article |
Statements
Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (English)
0 references
11 September 2015
0 references
\(k\)-path vertex cover
0 references
connected \(k\)-subgraph cover
0 references
approximation algorithm
0 references
0 references
