Liming Cai, David W. Juedes, Iyad A. Kanj. The inapproximability of non-NP-hard optimization problems. Theoretical Computer Science, 289(1):553-571, 2002.
@article{CaiJK02,
title = {The inapproximability of non-NP-hard optimization problems},
author = {Liming Cai and David W. Juedes and Iyad A. Kanj},
year = {2002},
tags = {optimization},
researchr = {https://researchr.org/publication/CaiJK02},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {289},
number = {1},
pages = {553-571},
}