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 the normal view instead:
scientific article; zbMATH DE number 6566335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover |
scientific article; zbMATH DE number 6566335 |
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
0.9533172249794006
0 references
0.9186240434646606
0 references
0.9104127287864684
0 references
0.896922767162323
0 references
0.8905267715454102
0 references
