{"id":"https://openalex.org/W2001258377","doi":"https://doi.org/10.1016/0304-3975(95)00060-7","title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","display_name":"On an approximation measure founded on the links between optimization and polynomial approximation theory","publication_year":1996,"publication_date":"1996-05-01","ids":{"openalex":"https://openalex.org/W2001258377","doi":"https://doi.org/10.1016/0304-3975(95)00060-7","mag":"2001258377"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(95)00060-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00060-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/A5089562675","display_name":"Marc Demange","orcid":"https://orcid.org/0000-0001-6195-2919"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Demange","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine,Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine,Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine,Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France"],"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine,Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111473903"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":3.6076,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.92720893,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"158","issue":"1-2","first_page":"117","last_page":"141"},"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.9994000196456909,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9980999827384949,"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.7370457649230957},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.695184051990509},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6081366539001465},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5571700930595398},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4951540529727936},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.45815882086753845},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.43086305260658264},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42994070053100586},{"id":"https://openalex.org/keywords/axiomatic-system","display_name":"Axiomatic system","score":0.4215095043182373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4126533567905426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3576076030731201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32521912455558777}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7370457649230957},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.695184051990509},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6081366539001465},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5571700930595398},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4951540529727936},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.45815882086753845},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.43086305260658264},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42994070053100586},{"id":"https://openalex.org/C125773388","wikidata":"https://www.wikidata.org/wiki/Q792542","display_name":"Axiomatic system","level":3,"score":0.4215095043182373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4126533567905426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3576076030731201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32521912455558777},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(95)00060-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)00060-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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1530753374","https://openalex.org/W1564250817","https://openalex.org/W1591297608","https://openalex.org/W1680189815","https://openalex.org/W1975218943","https://openalex.org/W2001258377","https://openalex.org/W2011039300","https://openalex.org/W2024380444","https://openalex.org/W2026891055","https://openalex.org/W2038225707","https://openalex.org/W2053913299","https://openalex.org/W2086917808","https://openalex.org/W2274388900","https://openalex.org/W2577446513","https://openalex.org/W2621352389","https://openalex.org/W2767036992","https://openalex.org/W2905110430","https://openalex.org/W3146615627","https://openalex.org/W4285719527","https://openalex.org/W6635467607","https://openalex.org/W6694670524","https://openalex.org/W6745738377"],"related_works":["https://openalex.org/W1712180277","https://openalex.org/W2056597184","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W1548167816"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}