Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.12.004 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2216743162 / rank | |||
Revision as of 14:59, 19 March 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
