{"id":"https://openalex.org/W2089061537","doi":"https://doi.org/10.1016/s0304-3975(97)00099-6","title":"Differential approximation algorithms for some combinatorial optimization problems","display_name":"Differential approximation algorithms for some combinatorial optimization problems","publication_year":1998,"publication_date":"1998-12-01","ids":{"openalex":"https://openalex.org/W2089061537","doi":"https://doi.org/10.1016/s0304-3975(97)00099-6","mag":"2089061537"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(97)00099-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00099-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397597000996/pdf","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":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0304397597000996/pdf","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","Univ. Paris Dauphine, Paris, France#TAB#"],"raw_orcid":null,"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":"Univ. Paris Dauphine, Paris, France#TAB#","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048707508","display_name":"Pascal Grisoni","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":"Pascal Grisoni","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","Univ. Paris Dauphine, Paris, France#TAB#"],"raw_orcid":null,"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":"Univ. Paris Dauphine, Paris, France#TAB#","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","Univ. Paris Dauphine, Paris, France#TAB#"],"raw_orcid":null,"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":"Univ. Paris Dauphine, Paris, France#TAB#","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111473903"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":7.0513,"has_fulltext":true,"cited_by_count":51,"citation_normalized_percentile":{"value":0.96676694,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"209","issue":"1-2","first_page":"107","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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.9983999729156494,"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.734322190284729},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7130307555198669},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6804327368736267},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6682283282279968},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6380689740180969},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6189693808555603},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5431662201881409},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5259699821472168},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5052528977394104},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42589855194091797},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34444430470466614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33342015743255615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14770960807800293}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.734322190284729},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7130307555198669},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6804327368736267},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6682283282279968},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6380689740180969},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6189693808555603},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5431662201881409},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5259699821472168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5052528977394104},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42589855194091797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34444430470466614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33342015743255615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14770960807800293},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(97)00099-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00099-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397597000996/pdf","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s0304-3975(97)00099-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(97)00099-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397597000996/pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2089061537.pdf","grobid_xml":"https://content.openalex.org/works/W2089061537.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W366160044","https://openalex.org/W1963511606","https://openalex.org/W1975218943","https://openalex.org/W1978711446","https://openalex.org/W1984818365","https://openalex.org/W1987745187","https://openalex.org/W2001258377","https://openalex.org/W2011039300","https://openalex.org/W2024380444","https://openalex.org/W2036660814","https://openalex.org/W2040924621","https://openalex.org/W2079473728","https://openalex.org/W2095314925","https://openalex.org/W2145028977","https://openalex.org/W2145152745","https://openalex.org/W2153663865","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W6665191260"],"related_works":["https://openalex.org/W9203110","https://openalex.org/W2551034790","https://openalex.org/W2029933769","https://openalex.org/W1712180277","https://openalex.org/W2757966824","https://openalex.org/W2056597184","https://openalex.org/W2906863651","https://openalex.org/W1502438505","https://openalex.org/W1968988491","https://openalex.org/W2379188955"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}