Login / Signup

The Inapproximability of Non NP-hard Optimization Problems.

Liming CaiDavid W. JuedesIyad A. Kanj
Published in: ISAAC (1998)
Keyphrases
  • np hard optimization problems
  • approximation algorithms
  • special case
  • np hard
  • game theory