Login / Signup

Towards Hardness of Approximation for Polynomial Time Problems.

Amir AbboudArturs Backurs
Published in: ITCS (2017)
Keyphrases
  • np complete
  • approximation algorithms
  • np hardness
  • computational complexity
  • np hard
  • genetic algorithm
  • special case
  • optimization problems
  • information theoretic
  • error bounds
  • solving problems
  • approximation ratio