{"id":"https://openalex.org/W2040579873","doi":"https://doi.org/10.1145/62212.62233","title":"Optimization, approximation, and complexity classes","display_name":"Optimization, approximation, and complexity classes","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2040579873","doi":"https://doi.org/10.1145/62212.62233","mag":"2040579873"},"language":"en","primary_location":{"id":"doi:10.1145/62212.62233","doi":"https://doi.org/10.1145/62212.62233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/62212.62233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/62212.62233","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/62212.62233","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0000-7264-8015","observed_orcids":["https://orcid.org/0009-0000-7264-8015"]},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christos Papadimitriou","raw_affiliation_strings":["University of California, San Diego"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860","observed_orcids":["https://orcid.org/0000-0003-2857-1860"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["AT&T Bell Laboratories","AT&T Bell Labs.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Labs.#TAB#","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.0939,"has_fulltext":true,"cited_by_count":224,"citation_normalized_percentile":{"value":0.97297297,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"234"},"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.9965999722480774,"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.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0027000000700354576,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/optimization-problems","display_name":"optimization problems","score":0.7670000195503235},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8069999814033508},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"polynomial-time approximation scheme","score":0.7620000243186951},{"id":"https://openalex.org/keywords/completeness","display_name":"completeness","score":0.40799999237060547},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.7110000252723694}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7375733256340027},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.6213600635528564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.601555347442627},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5663092136383057},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5562766790390015},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5457609295845032},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5254651308059692},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5138459801673889},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.49261146783828735},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4760810434818268},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4625591039657593},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4246480166912079},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.407539963722229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39963841438293457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.349545955657959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2974729537963867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21799102425575256},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.12806013226509094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09498551487922668},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/62212.62233","doi":"https://doi.org/10.1145/62212.62233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/62212.62233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/62212.62233","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/62212.62233","doi":"https://doi.org/10.1145/62212.62233","is_oa":true,"landing_page_url":"https://doi.org/10.1145/62212.62233","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/62212.62233","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2040579873.pdf","grobid_xml":"https://content.openalex.org/works/W2040579873.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1510300750","https://openalex.org/W1517125942","https://openalex.org/W1583013012","https://openalex.org/W1975218943","https://openalex.org/W1981455469","https://openalex.org/W1983592887","https://openalex.org/W2011039300","https://openalex.org/W2025904765","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2053548601","https://openalex.org/W2056090079","https://openalex.org/W2078007422","https://openalex.org/W2089929819","https://openalex.org/W2104881994","https://openalex.org/W2172111548","https://openalex.org/W3127113455","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W7099433456","https://openalex.org/W2127113976","https://openalex.org/W2082160108","https://openalex.org/W7100414592","https://openalex.org/W2020889012","https://openalex.org/W16097939","https://openalex.org/W2390999836","https://openalex.org/W2015101476","https://openalex.org/W202443291","https://openalex.org/W7097358290"],"abstract_inverted_index":{"We":[0,30],"define":[1],"a":[2,11,48,57,71,75,97],"natural":[3],"variant":[4],"of":[5,19,50,59,91,96,99],"NP,":[6,8],"MAX":[7,14],"and":[9,22],"also":[10],"subclass":[12],"called":[13],"SNP.":[15],"These":[16,84],"are":[17,54],"classes":[18,36],"optimization":[20,52,100],"problems,":[21],"in":[23,34],"fact":[24],"contain":[25],"several":[26],"natural,":[27],"well-studied":[28],"ones.":[29],"show":[31,46],"that":[32,47,64,69],"problems":[33,53],"these":[35],"can":[37],"be":[38],"approximated":[39],"with":[40],"some":[41],"bounded":[42],"error.":[43],"Furthermore,":[44],"we":[45],"number":[49],"common":[51],"complete":[55,72],"under":[56],"kind":[58],"careful":[60],"transformation":[61],"(called":[62],"L-reduction)":[63],"preserves":[65],"approximability.":[66],"It":[67],"follows":[68],"such":[70],"problem":[73],"has":[74],"polynomial-time":[76],"approximation":[77],"scheme":[78],"iff":[79],"the":[80,89,94],"whole":[81],"class":[82],"does.":[83],"results":[85],"may":[86],"help":[87],"explain":[88],"lack":[90],"progress":[92],"on":[93],"approximability":[95],"host":[98],"problems.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}