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.

Authors

Liming Cai

This author has not been identified. Look up 'Liming Cai' in Google

David W. Juedes

This author has not been identified. Look up 'David W. Juedes' in Google

Iyad A. Kanj

This author has not been identified. Look up 'Iyad A. Kanj' in Google