{"id":"https://openalex.org/W2078792212","doi":"https://doi.org/10.1051/ro:2003009","title":"Autour de nouvelles notions pour l'analyse des algorithmes d'approximation\u00a0: de la structure de NPO \u00e0 la structure des instances","display_name":"Autour de nouvelles notions pour l'analyse des algorithmes d'approximation\u00a0: de la structure de NPO \u00e0 la structure des instances","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2078792212","doi":"https://doi.org/10.1051/ro:2003009","mag":"2078792212"},"language":"fr","primary_location":{"id":"doi:10.1051/ro:2003009","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2003009","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2003009.pdf","any_repository_has_fulltext":true},"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/I124261006","display_name":"\u00c9cole Sup\u00e9rieure des Sciences \u00c9conomiques et Commerciales","ror":"https://ror.org/02dga6j42","country_code":"FR","type":"other","lineage":["https://openalex.org/I124261006"]},{"id":"https://openalex.org/I4210142324","display_name":"CY Cergy Paris Universit\u00e9","ror":"https://ror.org/043htjv09","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210142324"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Marc Demange","raw_affiliation_strings":["ESSEC, Cergy-Pontoise, France; demange@essec.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ESSEC, Cergy-Pontoise, France; demange@essec.fr","institution_ids":["https://openalex.org/I124261006","https://openalex.org/I4210142324"]}]},{"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":false,"raw_author_name":"Vangelis Paschos","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, France; paschos@lamsade.dauphine.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris-Dauphine, France; paschos@lamsade.dauphine.fr","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17060653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"4","first_page":"311","last_page":"350"},"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.9948999881744385,"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.9948999881744385,"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.987500011920929,"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"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.6800909042358398},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.6407721638679504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5369837880134583},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4975135624408722},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.48936790227890015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3266782760620117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3243497312068939}],"concepts":[{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6800909042358398},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.6407721638679504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5369837880134583},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4975135624408722},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.48936790227890015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3266782760620117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3243497312068939},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:2003009","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2003009","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2002__36_4_311_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2003009/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2003009.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2002__36_4_311_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2003009/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2003009.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2078792212.pdf","grobid_xml":"https://content.openalex.org/works/W2078792212.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W11978745","https://openalex.org/W204214429","https://openalex.org/W261470166","https://openalex.org/W1481223916","https://openalex.org/W1530753374","https://openalex.org/W1590159142","https://openalex.org/W1680189815","https://openalex.org/W1972345639","https://openalex.org/W1975218943","https://openalex.org/W1976422444","https://openalex.org/W1990313671","https://openalex.org/W1993793260","https://openalex.org/W1998902878","https://openalex.org/W2011039300","https://openalex.org/W2011869755","https://openalex.org/W2015101476","https://openalex.org/W2024380444","https://openalex.org/W2025698306","https://openalex.org/W2026561695","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2043097561","https://openalex.org/W2053913299","https://openalex.org/W2056090079","https://openalex.org/W2069816168","https://openalex.org/W2081254453","https://openalex.org/W2089061537","https://openalex.org/W2089247135","https://openalex.org/W2090186532","https://openalex.org/W2117158270","https://openalex.org/W2137560895","https://openalex.org/W2146197411","https://openalex.org/W2150636758","https://openalex.org/W2159579504","https://openalex.org/W2160111458","https://openalex.org/W2401610261","https://openalex.org/W2486715098","https://openalex.org/W2514261354","https://openalex.org/W2611804663","https://openalex.org/W3022694456","https://openalex.org/W3152126650"],"related_works":["https://openalex.org/W2131810278","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W2963411648","https://openalex.org/W2016001296","https://openalex.org/W2019123979","https://openalex.org/W3125240838","https://openalex.org/W1606488336","https://openalex.org/W1963195391","https://openalex.org/W2073435288"],"abstract_inverted_index":{"This":[0,97,134,211],"paper":[1,7],"is":[2,99],"the":[3,6,38,59,94,100,110,115,141,144,183,193,198,201,206,223,230,233],"continuation":[4],"of":[5,41,65,80,93,117,126,131,143,152,175,200,205,208,213,222,225,229,235],"\u201cAutour":[8],"de":[9],"nouvelles":[10],"notions":[11],"pour":[12],"l'analyse":[13],"des":[14],"algorithmes":[15],"d'approximation:":[16],"Formalisme":[17],"unifi\u00e9":[18],"et":[19],"classes":[20],"d'approximation\u201d":[21],"where":[22],"a":[23,56,118,123,128,153,176,209,219],"new":[24,119,135],"formalism":[25,111],"for":[26,54,58,168,187,218,232,238],"polynomial":[27],"approximation":[28,91],"and":[29,47,113,228],"its":[30],"basic":[31],"tools":[32,68],"allowing":[33,75],"an":[34,73],"\u201cabsolute\u201d":[35],"(individual)":[36],"evaluation":[37],"approximability":[39,78],"properties":[40,79,174],"NP-hard":[42],"problems":[43,64,82,95,227],"have":[44],"been":[45],"presented":[46,112],"discussed.":[48],"In":[49],"order":[50,159],"to":[51,106,139,160,170,197],"be":[52,70,86],"used":[53],"exhibiting":[55],"structure":[57,202],"class":[60],"NPO":[61],"(the":[62],"optimization":[63],"NP),":[66],"these":[67],"must":[69,85],"enriched":[71],"with":[72],"\u201cinstrument\u201d":[74],"comparisons":[76,84],"between":[77,150,156,164],"different":[81],"(these":[83],"independent":[87],"on":[88],"any":[89],"specific":[90,124],"result":[92],"concerned).":[96],"instrument":[98],"approximability-preserving":[101],"reductions.":[102],"We":[103],"show":[104],"how":[105,172],"integrate":[107],"them":[108],"in":[109,158],"propose":[114],"definition":[116],"reduction":[120,136],"unifying,":[121],"under":[122],"point":[125,212],"view":[127,214],"great":[129],"number":[130],"existing":[132],"ones.":[133],"allows":[137],"also":[138],"widen":[140],"use":[142],"reductions,":[145],"restricted":[146],"until":[147],"now":[148],"either":[149],"versions":[151],"problem,":[154,185],"or":[155,186],"problems,":[157],"enhance":[161],"structural":[162],"relations":[163],"frameworks.":[165],"They":[166],"allow,":[167],"example,":[169],"study":[171,199],"standard-approximation":[173],"problem":[177],"transform":[178],"into":[179],"differential-approximation":[180],"ones":[181],"(for":[182],"same":[184],"another":[188],"one).":[189],"Finally,":[190],"we":[191],"apply":[192],"several":[194],"concepts":[195],"introduced":[196],"(and":[203],"hardness)":[204],"instances":[207],"problem.":[210],"seems":[215],"particurarly":[216],"fruitful":[217],"better":[220],"apprehension":[221],"hardness":[224],"certain":[226],"mechanisms":[231],"design":[234],"efficient":[236],"solutions":[237],"them.":[239]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}