An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655)
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 approximation algorithm for the partial vertex cover problem in hypergraphs |
scientific article; zbMATH DE number 6544343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the partial vertex cover problem in hypergraphs |
scientific article; zbMATH DE number 6544343 |
Statements
An approximation algorithm for the partial vertex cover problem in hypergraphs (English)
0 references
23 February 2016
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
hypergraphs
0 references
vertex cover
0 references
probabilistic methods
0 references
0.960325300693512
0 references
0.8668960332870483
0 references
0.8499966859817505
0 references
0.8442292809486389
0 references
