Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936)
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: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs |
scientific article; zbMATH DE number 5675313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs |
scientific article; zbMATH DE number 5675313 |
Statements
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (English)
0 references
26 February 2010
0 references
connected vertex cover
0 references
chordal graphs
0 references
bipartite graphs
0 references
planar graphs
0 references
hypergraphs
0 references
approximation algorithm
0 references
0.9829875
0 references
0.9590697
0 references
0.9460479
0 references
0 references
0.9371005
0 references
0.9343951
0 references
0.93384224
0 references
0.9327127
0 references
