Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613)
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: Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs |
scientific article |
Statements
Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (English)
0 references
18 August 2015
0 references
approximation algorithms
0 references
approximation hardness
0 references
vertex cover
0 references
set cover
0 references
dense hypergraphs
0 references
\(k\)-partite \(k\)-uniform hypergraphs
0 references
0 references
0 references
0 references
0 references
