Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:46, 30 January 2024
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
