Randomized approximation for the set multicover problem in hypergraphs (Q262245)
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: Randomized approximation for the set multicover problem in hypergraphs |
scientific article; zbMATH DE number 6560719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized approximation for the set multicover problem in hypergraphs |
scientific article; zbMATH DE number 6560719 |
Statements
Randomized approximation for the set multicover problem in hypergraphs (English)
0 references
29 March 2016
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
randomized algorithm
0 references
hypergraphs
0 references
set cover
0 references
set multicover
0 references
0 references
0.9249327778816224
0 references
0.8925359845161438
0 references
0.8543228507041931
0 references
0.8498621582984924
0 references
0.8498621582984924
0 references
