{"id":"https://openalex.org/W2033893726","doi":"https://doi.org/10.1051/ro:1999121","title":"Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems","display_name":"Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems","publication_year":1999,"publication_date":"1999-10-01","ids":{"openalex":"https://openalex.org/W2033893726","doi":"https://doi.org/10.1051/ro:1999121","mag":"2033893726"},"language":"en","primary_location":{"id":"doi:10.1051/ro:1999121","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999121","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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/RO_1999__33_4_481_0.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/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I51101395","display_name":"Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne","ror":"https://ror.org/002t25c44","country_code":"FR","type":"education","lineage":["https://openalex.org/I51101395"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Marc Demange","raw_affiliation_strings":["CERMSEM, Universite Paris I, 106-112 boulevard de l'H\u00f4pital, 75647 Paris Cedex 13, France","CERMSEM, Universit\u00e9 Paris I, 106-112 boulevard de l\u2019H\u00f4pital, 75647 Paris Cedex 13, France"],"affiliations":[{"raw_affiliation_string":"CERMSEM, Universite Paris I, 106-112 boulevard de l'H\u00f4pital, 75647 Paris Cedex 13, France","institution_ids":[]},{"raw_affiliation_string":"CERMSEM, Universit\u00e9 Paris I, 106-112 boulevard de l\u2019H\u00f4pital, 75647 Paris Cedex 13, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I51101395"]}]},{"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 Th. Paschos","raw_affiliation_strings":["LAMSADE, Universite Paris-Dauphine, Place du Marechal 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, Universite Paris-Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":[]},{"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/A5089562675"],"corresponding_institution_ids":["https://openalex.org/I204730241","https://openalex.org/I51101395"],"apc_list":null,"apc_paid":null,"fwci":0.4884,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65277778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"4","first_page":"481","last_page":"507"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T12176","display_name":"Optimization and Packing Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9850999712944031,"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.7044504880905151},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7031566500663757},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6899226903915405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5322945713996887},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5282691717147827},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.47094619274139404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4255017340183258},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3630130887031555}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7044504880905151},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7031566500663757},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6899226903915405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5322945713996887},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5282691717147827},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.47094619274139404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4255017340183258},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3630130887031555}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:1999121","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:1999121","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"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_1999__33_4_481_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_4_481_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_4_481_0.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_1999__33_4_481_0","is_oa":true,"landing_page_url":"http://www.numdam.org/item/RO_1999__33_4_481_0/","pdf_url":"https://www.numdam.org/item/RO_1999__33_4_481_0.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":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2033893726.pdf","grobid_xml":"https://content.openalex.org/works/W2033893726.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2379188955","https://openalex.org/W2757966824","https://openalex.org/W2056597184","https://openalex.org/W1608414128","https://openalex.org/W1712180277","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W2096382750","https://openalex.org/W2094388041"],"abstract_inverted_index":{"We":[0,53],"first":[1,54],"motivate":[2],"and":[3,45,81,89],"define":[4],"a":[5,16,56,61,79,86,91,119],"notion":[6],"of":[7,19,35,60,78,85,112],"asymptotic":[8,37],"differential":[9,38,57,106],"approximation":[10,39,47,58,107,122],"ratio.":[11],"For":[12],"this,":[13],"we":[14,31,73,102],"introduce":[15],"new":[17],"class":[18],"problems":[20,23],"called":[21],"radial":[22],"including":[24],"in":[25],"particular":[26],"the":[27,33,36,68,82,96,99,110],"hereditary":[28],"ones.":[29],"Next,":[30],"validate":[32],"definition":[34],"ratio":[40],"by":[41,118],"proving":[42],"positive,":[43],"conditional":[44],"negative":[46,105],"results":[48,108],"for":[49,65],"some":[50],"combinatorial":[51],"problems.":[52],"derive":[55],"analysis":[59],"classical":[62],"greedy":[63],"algorithm":[64],"bin":[66],"packing,":[67],"\u201cfirst":[69],"fit":[70],"decreasing\u201d.":[71],"Next":[72],"deal":[74],"with":[75],"minimum":[76,83,113],"vertex-covering-by-cliques":[77],"graph":[80,88],"edge-covering-by-complete-bipartite-subgraphs":[84],"bipartite":[87],"devise":[90],"differential-approximation":[92],"preserving":[93],"reduction":[94],"from":[95],"former":[97],"to":[98,115],"latter.":[100],"Finally,":[101],"prove":[103],"two":[104],"about":[109],"ability":[111],"vertex-coloring":[114],"be":[116],"approximated":[117],"polynomial":[120],"time":[121],"schema.":[123]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}