Login / Signup
The inapproximability of non-NP-hard optimization problems.
Liming Cai
David W. Juedes
Iyad A. Kanj
Published in:
Theor. Comput. Sci. (2002)
Keyphrases
</>
np hard optimization problems
approximation algorithms
np hard
special case
game theory
nash equilibrium