Approximation algorithms for the partition vertex cover problem (Q744047)
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: Approximation algorithms for the partition vertex cover problem |
scientific article; zbMATH DE number 6351402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the partition vertex cover problem |
scientific article; zbMATH DE number 6351402 |
Statements
Approximation algorithms for the partition vertex cover problem (English)
0 references
6 October 2014
0 references
approximation algorithm
0 references
vertex cover
0 references
knapsack cover inequality
0 references
LP rounding
0 references
0 references
0 references
0.9919071793556212
0 references
0.8450971245765686
0 references
0.8422217965126038
0 references
0.8404901027679443
0 references
