{"id":"https://openalex.org/W2062172380","doi":"https://doi.org/10.1016/s0304-3975(01)00343-7","title":"The inapproximability of non-NP-hard optimization problems","display_name":"The inapproximability of non-NP-hard optimization problems","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2062172380","doi":"https://doi.org/10.1016/s0304-3975(01)00343-7","mag":"2062172380"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00343-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00343-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012513857","display_name":"Liming Cai","orcid":"https://orcid.org/0000-0002-8982-2435"},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liming Cai","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Ohio University, Athens, OH 45701, USA","School of Electrical Engineering and Computer Science, Ohio University, Athens, OH#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH 45701, USA","institution_ids":["https://openalex.org/I4210106879"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH#TAB#","institution_ids":["https://openalex.org/I4210106879"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020524364","display_name":"David Juedes","orcid":"https://orcid.org/0000-0002-1656-5781"},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David Juedes","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Ohio University, Athens, OH 45701, USA","School of Electrical Engineering and Computer Science, Ohio University, Athens, OH#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH 45701, USA","institution_ids":["https://openalex.org/I4210106879"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Ohio University, Athens, OH#TAB#","institution_ids":["https://openalex.org/I4210106879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad Kanj","raw_affiliation_strings":["School of Computer Science, Telecommunications, and Information Systems, DePaul University, Chicago, IL 60604, USA","School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Telecommunications, and Information Systems, DePaul University, Chicago, IL 60604, USA","institution_ids":["https://openalex.org/I118353179"]},{"raw_affiliation_string":"School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL#TAB#","institution_ids":["https://openalex.org/I118353179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020524364"],"corresponding_institution_ids":["https://openalex.org/I4210106879"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0466,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.75591821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"289","issue":"1","first_page":"553","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8666397333145142},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7868138551712036},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7609114646911621},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.7130721211433411},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7010676860809326},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.677580714225769},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.6231242418289185},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6127671003341675},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6010988354682922},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5637915134429932},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4911153018474579},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4574339985847473},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4544331431388855},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.45046231150627136},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.44670966267585754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4153901934623718},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3702322840690613},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17628031969070435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17395085096359253},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.17106080055236816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15104636549949646}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8666397333145142},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7868138551712036},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7609114646911621},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.7130721211433411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7010676860809326},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.677580714225769},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.6231242418289185},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6127671003341675},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6010988354682922},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5637915134429932},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4911153018474579},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4574339985847473},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4544331431388855},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.45046231150627136},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.44670966267585754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4153901934623718},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3702322840690613},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17628031969070435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17395085096359253},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.17106080055236816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15104636549949646},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(01)00343-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00343-7","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W117318854","https://openalex.org/W204341840","https://openalex.org/W207046415","https://openalex.org/W1501644705","https://openalex.org/W1504650505","https://openalex.org/W1532726290","https://openalex.org/W1598441350","https://openalex.org/W1918504188","https://openalex.org/W1973852671","https://openalex.org/W1985250585","https://openalex.org/W1990313671","https://openalex.org/W2000869424","https://openalex.org/W2013155780","https://openalex.org/W2017893027","https://openalex.org/W2019578639","https://openalex.org/W2022841964","https://openalex.org/W2029859729","https://openalex.org/W2040922070","https://openalex.org/W2040924621","https://openalex.org/W2043997666","https://openalex.org/W2045519569","https://openalex.org/W2045717693","https://openalex.org/W2081254453","https://openalex.org/W2089247135","https://openalex.org/W2132605415","https://openalex.org/W2137560895","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2143996311","https://openalex.org/W2148043549","https://openalex.org/W2152221184","https://openalex.org/W2158355632","https://openalex.org/W2177603603","https://openalex.org/W2337710787","https://openalex.org/W2398093569","https://openalex.org/W4246874244","https://openalex.org/W4249409086","https://openalex.org/W6608311587"],"related_works":["https://openalex.org/W1561811279","https://openalex.org/W2009846993","https://openalex.org/W1966805076","https://openalex.org/W2169416073","https://openalex.org/W1655323853","https://openalex.org/W1584635930","https://openalex.org/W2951227808","https://openalex.org/W2062172380","https://openalex.org/W2073435288","https://openalex.org/W2952838392"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}