A 2-approximation algorithm for the vertex cover \(P_{4}\) problem in cubic graphs (Q2931950)
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 algorithm for the vertex cover Pā problem in cubic graphs |
scientific article; zbMATH DE number 6374998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-approximation algorithm for the vertex cover \(P_{4}\) problem in cubic graphs |
scientific article; zbMATH DE number 6374998 |
Statements
A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (English)
0 references
28 November 2014
0 references
combinatorial optimization
0 references
vertex cover \(P_{4}\) problem
0 references
approximation algorithm
0 references
cubic graph
0 references
sharp lower and upper bounds
0 references
0.9296135902404784
0 references
0.864635169506073
0 references
0.8600094318389893
0 references
0.8455103635787964
0 references
0.8426752686500549
0 references
