Login / Signup
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
Sushant Sachdeva
Rishi Saket
Published in:
CoRR (2011)
Keyphrases
</>
np hardness
vertex cover
approximation algorithms
worst case
np hard
optimality criterion
optimal solution
special case
precedence constraints
scheduling problem
lower bound
mixed integer
finding optimal
training set
dynamic programming