Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765)
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 algorithm for the minimum weight connected k-subgraph cover problem |
scientific article; zbMATH DE number 6289934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem |
scientific article; zbMATH DE number 6289934 |
Statements
Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (English)
0 references
29 April 2014
0 references
\(k\)-path vertex cover
0 references
connected \(k\)-subgraph vertex cover
0 references
0.9266979694366456
0 references
0.9133482575416564
0 references
0.896922767162323
0 references
0.8945325613021851
0 references
0.8716412782669067
0 references
