


default search action
"Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs."
Sushant Sachdeva, Rishi Saket (2011)
- Sushant Sachdeva
, Rishi Saket:
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs. APPROX-RANDOM 2011: 327-338

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.