A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219)
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: A 2-approximation NC algorithm for connected vertex cover and tree cover |
scientific article; zbMATH DE number 5581106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation NC algorithm for connected vertex cover and tree cover |
scientific article; zbMATH DE number 5581106 |
Statements
A 2-approximation NC algorithm for connected vertex cover and tree cover (English)
0 references
21 July 2009
0 references
approximation algorithms
0 references
parallel algorithms
0 references
connected vertex cover
0 references
tree cover
0 references
0.8302339315414429
0 references
0.8238236904144287
0 references
0.8196962475776672
0 references
0.8036938309669495
0 references
