A randomised approximation algorithm for the partial vertex cover problem in hypergraphs (Q4916041)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6155855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomised approximation algorithm for the partial vertex cover problem in hypergraphs |
scientific article; zbMATH DE number 6155855 |
Statements
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs (English)
0 references
19 April 2013
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
hypergarphs
0 references
vertex cover
0 references
probabilistic methods
0 references
0.960325300693512
0 references
0.8717979192733765
0 references
0.8713160753250122
0 references
0.8707773685455322
0 references
0.8650486469268799
0 references
