Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568)
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 5294910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and Approximation Results for the Connected Vertex Cover Problem |
scientific article; zbMATH DE number 5294910 |
Statements
Complexity and Approximation Results for the Connected Vertex Cover Problem (English)
0 references
1 July 2008
0 references
Connected vertex cover
0 references
chordal graphs
0 references
bipartite graphs
0 references
planar graphs
0 references
APX-complete
0 references
approximation algorithm
0 references
0.9717625379562378
0 references
0.8535809516906738
0 references
0.8500010371208191
0 references
0.8384404182434082
0 references
0.8334444165229797
0 references
