{"id":"https://openalex.org/W2015101476","doi":"https://doi.org/10.1016/0304-3975(94)00291-p","title":"Approximate solution of NP optimization problems","display_name":"Approximate solution of NP optimization problems","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W2015101476","doi":"https://doi.org/10.1016/0304-3975(94)00291-p","mag":"2015101476"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)00291-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00291-p","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/A5102716483","display_name":"Giorgio Ausiello","orcid":null},"institutions":[{"id":"https://openalex.org/I4210135106","display_name":"Universit\u00e0 degli Studi Internazionali di Roma","ror":"https://ror.org/037263487","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210135106"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Ausiello","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","Univ. degli Studi di Roma, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Univ. degli Studi di Roma, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I4210135106"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012362492","display_name":"Pierluigi Crescenzi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210135106","display_name":"Universit\u00e0 degli Studi Internazionali di Roma","ror":"https://ror.org/037263487","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210135106"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Crescenzi","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","Univ. degli Studi di Roma, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, Via Salaria 113, 00198, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"Univ. degli Studi di Roma, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I4210135106"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112193012","display_name":"Marco Protasi","orcid":null},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]},{"id":"https://openalex.org/I4210135106","display_name":"Universit\u00e0 degli Studi Internazionali di Roma","ror":"https://ror.org/037263487","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210135106"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Protasi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma, Italy","Univ. degli Studi di Roma, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma \u201cTor Vergata\u201d, Via della Ricerca Scientifica, 00133 Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Univ. degli Studi di Roma, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I4210135106"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102716483"],"corresponding_institution_ids":["https://openalex.org/I4210135106","https://openalex.org/I861853513"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":10.1616,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.98829175,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"150","issue":"1","first_page":"1","last_page":"55"},"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.9998000264167786,"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.9998000264167786,"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.996999979019165,"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.9957000017166138,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.6796896457672119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6761132478713989},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6439365148544312},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6008129119873047},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4976032078266144},{"id":"https://openalex.org/keywords/apx","display_name":"APX","score":0.4899517595767975},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4839756488800049},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.48249387741088867},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4678424596786499},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4337165355682373},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43283721804618835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43268200755119324},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39924493432044983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3336675465106964},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24982136487960815},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0725875198841095},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.05787643790245056}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6796896457672119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6761132478713989},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6439365148544312},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6008129119873047},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4976032078266144},{"id":"https://openalex.org/C130698151","wikidata":"https://www.wikidata.org/wiki/Q4653447","display_name":"APX","level":4,"score":0.4899517595767975},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4839756488800049},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.48249387741088867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4678424596786499},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4337165355682373},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43283721804618835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43268200755119324},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39924493432044983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3336675465106964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24982136487960815},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0725875198841095},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.05787643790245056},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C162008176","wikidata":"https://www.wikidata.org/wiki/Q419305","display_name":"Peroxidase","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C181199279","wikidata":"https://www.wikidata.org/wiki/Q8047","display_name":"Enzyme","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0304-3975(94)00291-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00291-p","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"},{"id":"pmh:oai:flore.unifi.it:2158/205999","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/205999","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/13788","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/13788","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W176350590","https://openalex.org/W234224109","https://openalex.org/W1542883217","https://openalex.org/W1557755441","https://openalex.org/W1605991832","https://openalex.org/W1636637297","https://openalex.org/W1972345639","https://openalex.org/W1975218943","https://openalex.org/W1975220965","https://openalex.org/W1975790950","https://openalex.org/W1976157781","https://openalex.org/W1977674079","https://openalex.org/W2008816554","https://openalex.org/W2009990213","https://openalex.org/W2011039300","https://openalex.org/W2015092796","https://openalex.org/W2019482147","https://openalex.org/W2022212237","https://openalex.org/W2022630275","https://openalex.org/W2024380444","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2053086236","https://openalex.org/W2053548601","https://openalex.org/W2053651631","https://openalex.org/W2053913299","https://openalex.org/W2056090079","https://openalex.org/W2060079637","https://openalex.org/W2063981365","https://openalex.org/W2070664846","https://openalex.org/W2072181151","https://openalex.org/W2079473728","https://openalex.org/W2085978811","https://openalex.org/W2089047615","https://openalex.org/W2100308637","https://openalex.org/W2105195422","https://openalex.org/W2116940701","https://openalex.org/W2132605415","https://openalex.org/W2141355868","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2152221184","https://openalex.org/W2798766386","https://openalex.org/W3127113455","https://openalex.org/W4229492708","https://openalex.org/W4233228894","https://openalex.org/W4235358177","https://openalex.org/W4243643814","https://openalex.org/W6609056239","https://openalex.org/W6633393025","https://openalex.org/W6636147295","https://openalex.org/W6636823743","https://openalex.org/W6638117189","https://openalex.org/W6644647999","https://openalex.org/W6653934158","https://openalex.org/W6655441522","https://openalex.org/W6656324803","https://openalex.org/W6663356168","https://openalex.org/W6663609517","https://openalex.org/W6665191260","https://openalex.org/W6674843440","https://openalex.org/W6679361736","https://openalex.org/W6680972544","https://openalex.org/W6681029245","https://openalex.org/W6681300758","https://openalex.org/W6789738865","https://openalex.org/W7065312267"],"related_works":["https://openalex.org/W2040579873","https://openalex.org/W3124896382","https://openalex.org/W2031636249","https://openalex.org/W2038225707","https://openalex.org/W2086077660","https://openalex.org/W2620153647","https://openalex.org/W2003266683","https://openalex.org/W2100137329","https://openalex.org/W3145277924","https://openalex.org/W2164794228"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}