Approximation algorithm for minimum connected 3-path vertex cover (Q2004079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm for minimum connected 3-path vertex cover |
scientific article; zbMATH DE number 7260820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithm for minimum connected 3-path vertex cover |
scientific article; zbMATH DE number 7260820 |
Statements
Approximation algorithm for minimum connected 3-path vertex cover (English)
0 references
14 October 2020
0 references
connected \(k\)-path vertex cover
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
