Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and Approximation Results for the Connected Vertex Cover Problem |
scientific article |
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
