Approximation algorithm for minimum connected 3-path vertex cover (Q2004079)
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 minimum connected 3-path vertex cover |
scientific article; zbMATH DE number 7260820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for minimum connected 3-path vertex cover |
scientific article; zbMATH DE number 7260820 |
Statements
Approximation algorithm for minimum connected 3-path vertex cover (English)
0 references
14 October 2020
0 references
connected \(k\)-path vertex cover
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.930328369140625
0 references
0.9186240434646606
0 references
0.9127739667892456
0 references
0.8619557619094849
0 references
0.8594728708267212
0 references
