Approximation algorithm for the minimum connected \(k\)-path vertex cover problem (Q2942448)
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 6480685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the minimum connected \(k\)-path vertex cover problem |
scientific article; zbMATH DE number 6480685 |
Statements
Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem (English)
0 references
11 September 2015
0 references
\(k\)-path vertex cover
0 references
connected \(k\)-subgraph cover
0 references
approximation algorithm
0 references
0.9533172249794006
0 references
0.930328369140625
0 references
0.8945325613021851
0 references
0.8777167201042175
0 references
0.8568455576896667
0 references
