{"id":"https://openalex.org/W2133668753","doi":"https://doi.org/10.1007/978-3-642-03367-4_44","title":"Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms","display_name":"Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2133668753","doi":"https://doi.org/10.1007/978-3-642-03367-4_44","mag":"2133668753"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03367-4_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_44","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://basepub.dauphine.fr/handle/123456789/5313","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005743823","display_name":"Nicolas Bourgeois","orcid":"https://orcid.org/0000-0001-5404-1260"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"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":"Nicolas Bourgeois","raw_affiliation_strings":["LAMSADE, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107073511","display_name":"Bruno Escoffier","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"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":"Bruno Escoffier","raw_affiliation_strings":["LAMSADE, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","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/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"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, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, CNRS FRE\u00a03234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, CNRS FRE 3234 and Universit\u00e9 Paris-Dauphine, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9141,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94260592,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"507","last_page":"518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8632774353027344},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7401043176651001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7114976644515991},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6596575975418091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6084508895874023},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5851583480834961},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.578446090221405},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.5784267783164978},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5619410276412964},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5414204597473145},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.517252504825592},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5169991254806519},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.514320969581604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46846407651901245},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4636107385158539},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4621508717536926},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.43987327814102173},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.4132747948169708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38109833002090454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21307626366615295},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15621697902679443}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8632774353027344},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7401043176651001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7114976644515991},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6596575975418091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6084508895874023},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5851583480834961},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.578446090221405},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.5784267783164978},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5619410276412964},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5414204597473145},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.517252504825592},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5169991254806519},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.514320969581604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46846407651901245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4636107385158539},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4621508717536926},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.43987327814102173},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.4132747948169708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38109833002090454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21307626366615295},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15621697902679443},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-03367-4_44","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03367-4_44","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/5313","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5313","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.fr:123456789/5313","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5313","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W117318854","https://openalex.org/W172361097","https://openalex.org/W1492330052","https://openalex.org/W1516574938","https://openalex.org/W1524356573","https://openalex.org/W1530685949","https://openalex.org/W1574082713","https://openalex.org/W1593916827","https://openalex.org/W1622655993","https://openalex.org/W1666834859","https://openalex.org/W1980328919","https://openalex.org/W1990313671","https://openalex.org/W2013415302","https://openalex.org/W2024380444","https://openalex.org/W2026771935","https://openalex.org/W2074359677","https://openalex.org/W2097844290","https://openalex.org/W2101009443","https://openalex.org/W2118980874","https://openalex.org/W2126186592","https://openalex.org/W2137118456","https://openalex.org/W2137560895","https://openalex.org/W2148352980","https://openalex.org/W2163938320","https://openalex.org/W2486715098","https://openalex.org/W2505201213","https://openalex.org/W2611804663","https://openalex.org/W3166880264","https://openalex.org/W4252095493","https://openalex.org/W4254780343","https://openalex.org/W4285719527","https://openalex.org/W7026635939"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W2063671489","https://openalex.org/W1966805076","https://openalex.org/W2077783414","https://openalex.org/W168093571","https://openalex.org/W1508327628","https://openalex.org/W2012700732","https://openalex.org/W1980842804"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":8}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}