Login / Signup

Nearly Optimal NP-Hardness of Unique Coverage.

Venkatesan GuruswamiEuiwoong Lee
Published in: SIAM J. Comput. (2017)
Keyphrases
  • np hardness
  • np hard
  • worst case analysis
  • approximation algorithms
  • optimal solution
  • dynamic programming
  • bayesian networks
  • worst case
  • mixed integer
  • learning algorithm
  • multi dimensional