Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943)
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 algorithms for minimum (weight) connected \(k\)-path vertex cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover |
scientific article |
Statements
Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (English)
0 references
7 April 2016
0 references
connected \(k\)-path vertex cover
0 references
weight
0 references
girth
0 references
approximation algorithm
0 references
