Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1107.2000 / rank | |||
Normal rank | |||
Revision as of 15:22, 18 April 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
