{"id":"https://openalex.org/W2040924621","doi":"https://doi.org/10.1016/s0022-0000(74)80044-9","title":"Approximation algorithms for combinatorial problems","display_name":"Approximation algorithms for combinatorial problems","publication_year":1974,"publication_date":"1974-12-01","ids":{"openalex":"https://openalex.org/W2040924621","doi":"https://doi.org/10.1016/s0022-0000(74)80044-9","mag":"2040924621"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(74)80044-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(74)80044-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","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/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David S. Johnson","raw_affiliation_strings":["Project MAC, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA"],"affiliations":[{"raw_affiliation_string":"Project MAC, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110866131"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":17.0509,"has_fulltext":false,"cited_by_count":2216,"citation_normalized_percentile":{"value":0.99300455,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"9","issue":"3","first_page":"256","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9516000151634216,"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/mathematics","display_name":"Mathematics","score":0.641925573348999},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5955766439437866},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5672376751899719},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.551672101020813},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5318431854248047},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5112853050231934},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.49702075123786926},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48061057925224304},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4793032705783844},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4689621031284332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45142996311187744},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45050716400146484},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4441654086112976},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4218767285346985},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4208475947380066},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.41176673769950867},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40396496653556824},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3707336187362671},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24902451038360596},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10791260004043579},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.07437708973884583}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.641925573348999},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5955766439437866},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5672376751899719},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.551672101020813},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5318431854248047},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5112853050231934},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.49702075123786926},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48061057925224304},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4793032705783844},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4689621031284332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45142996311187744},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45050716400146484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4441654086112976},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4218767285346985},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4208475947380066},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.41176673769950867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40396496653556824},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3707336187362671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24902451038360596},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10791260004043579},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.07437708973884583},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0022-0000(74)80044-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(74)80044-9","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W149461665","https://openalex.org/W594514321","https://openalex.org/W1531368347","https://openalex.org/W1579391414","https://openalex.org/W1595545560","https://openalex.org/W1597020313","https://openalex.org/W2002680893","https://openalex.org/W2036265926","https://openalex.org/W2046063196","https://openalex.org/W2058200712","https://openalex.org/W2066356146","https://openalex.org/W2108301529","https://openalex.org/W2128553546","https://openalex.org/W2401610261","https://openalex.org/W6634497547","https://openalex.org/W6635630268","https://openalex.org/W6644040475","https://openalex.org/W6650877037","https://openalex.org/W6659573362","https://openalex.org/W6662248159","https://openalex.org/W6664798580"],"related_works":["https://openalex.org/W2046112356","https://openalex.org/W2312409807","https://openalex.org/W4382561492","https://openalex.org/W2088153883","https://openalex.org/W1560842054","https://openalex.org/W3124896382","https://openalex.org/W2031636249","https://openalex.org/W2185752411","https://openalex.org/W2086077660","https://openalex.org/W3037934538"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":24},{"year":2024,"cited_by_count":27},{"year":2023,"cited_by_count":33},{"year":2022,"cited_by_count":51},{"year":2021,"cited_by_count":45},{"year":2020,"cited_by_count":54},{"year":2019,"cited_by_count":68},{"year":2018,"cited_by_count":89},{"year":2017,"cited_by_count":62},{"year":2016,"cited_by_count":64},{"year":2015,"cited_by_count":55},{"year":2014,"cited_by_count":69},{"year":2013,"cited_by_count":84},{"year":2012,"cited_by_count":77}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}