Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:07, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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