The inapproximability of non-NP-hard optimization problems

Liming Cai, David W. Juedes, Iyad A. Kanj. The inapproximability of non-NP-hard optimization problems. Theoretical Computer Science, 289(1):553-571, 2002.

No reviews for this publication, yet.