Login / Signup

The Complexity of Polynomial-Time Approximation.

Liming CaiMichael R. FellowsDavid W. JuedesFrances A. Rosamond
Published in: Theory Comput. Syst. (2007)
Keyphrases
  • polynomial time approximation
  • worst case
  • np hard
  • approximation algorithms
  • space complexity
  • error bounds
  • vertex cover
  • neural network
  • computational complexity
  • mathematical model