An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490)
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: An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem |
scientific article; zbMATH DE number 6336026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem |
scientific article; zbMATH DE number 6336026 |
Statements
An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (English)
0 references
29 August 2014
0 references
approximation algorithm
0 references
iterative rounding
0 references
\(k\)-partial vertex cover
0 references
combinatorial optimization
0 references
0.8627989292144775
0 references
0.8607481718063354
0 references
0.850957453250885
0 references
