default search action
"The inapproximability of non-NP-hard optimization problems."
Liming Cai, David W. Juedes, Iyad A. Kanj (2002)
- Liming Cai, David W. Juedes
, Iyad A. Kanj:
The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-26 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: