{"id":"https://openalex.org/W2060079637","doi":"https://doi.org/10.1016/0020-0190(90)90188-4","title":"Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems","display_name":"Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems","publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W2060079637","doi":"https://doi.org/10.1016/0020-0190(90)90188-4","mag":"2060079637"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(90)90188-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(90)90188-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","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/A5012362492","display_name":"Pierluigi Crescenzi","orcid":"https://orcid.org/0000-0001-8789-3195"},"institutions":[{"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 Matematika, Universit\u00e0 di Roma \u201cLa Sapienza\u201d. Piazzale Aldo Moro 2, 00185 Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematika, Universit\u00e0 di Roma \u201cLa Sapienza\u201d. Piazzale Aldo Moro 2, 00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056847255","display_name":"Riccardo Silvestri","orcid":null},"institutions":[{"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":"R. Silvestri","raw_affiliation_strings":["Dipartimento di Matematika, Universit\u00e0 di Roma \u201cLa Sapienza\u201d. Piazzale Aldo Moro 2, 00185 Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematika, Universit\u00e0 di Roma \u201cLa Sapienza\u201d. Piazzale Aldo Moro 2, 00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.18575123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"5","first_page":"221","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9988999962806702,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/time-complexity","display_name":"Time complexity","score":0.6920528411865234},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.6415186524391174},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.596136748790741},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5858029127120972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5825603604316711},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4738383889198303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44216811656951904},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3518252372741699},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2585974335670471},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09064880013465881}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6920528411865234},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.6415186524391174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.596136748790741},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5858029127120972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5825603604316711},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4738383889198303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44216811656951904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3518252372741699},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2585974335670471},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09064880013465881}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0020-0190(90)90188-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(90)90188-4","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"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":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:flore.unifi.it:2158/205994","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/205994","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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/48645","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/48645","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":null,"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":9,"referenced_works":["https://openalex.org/W1565875822","https://openalex.org/W1974647909","https://openalex.org/W1979746590","https://openalex.org/W2044504659","https://openalex.org/W2057718847","https://openalex.org/W2153191867","https://openalex.org/W4254964791","https://openalex.org/W6633842933","https://openalex.org/W6645186733"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2110817230","https://openalex.org/W3091355678","https://openalex.org/W1606488336","https://openalex.org/W4299801389","https://openalex.org/W1988569331","https://openalex.org/W4255193494","https://openalex.org/W2574604093","https://openalex.org/W189995875"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}