{"id":"https://openalex.org/W1985498227","doi":"https://doi.org/10.1016/s0304-3975(01)00005-6","title":"A priori optimization for the probabilistic maximum independent set problem","display_name":"A priori optimization for the probabilistic maximum independent set problem","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1985498227","doi":"https://doi.org/10.1016/s0304-3975(01)00005-6","mag":"1985498227"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00005-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00005-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397501000056/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/S0304397501000056/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037346228","display_name":"C\u00e9cile Murat","orcid":"https://orcid.org/0000-0001-8888-3685"},"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":"C\u00e9cile Murat","raw_affiliation_strings":["LAMSADE, Universit\u00e9 Paris-Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, F-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, F-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, F-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, F-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":2.3379,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.87496112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"270","issue":"1-2","first_page":"561","last_page":"590"},"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.9997000098228455,"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.9997000098228455,"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.9973999857902527,"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.9939000010490417,"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/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.8035048246383667},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.787821352481842},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5932634472846985},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5525559782981873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5481654405593872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5427610278129578},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5005538463592529},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48125502467155457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4245566725730896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3367183804512024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17730170488357544},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.061972618103027344}],"concepts":[{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.8035048246383667},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.787821352481842},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5932634472846985},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5525559782981873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5481654405593872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5427610278129578},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5005538463592529},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48125502467155457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4245566725730896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3367183804512024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17730170488357544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.061972618103027344},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(01)00005-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00005-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397501000056/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:basepub.dauphine.fr:123456789/2878","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/2878","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":"Article accept\u00e9 pour publication ou publi\u00e9"}],"best_oa_location":{"id":"doi:10.1016/s0304-3975(01)00005-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00005-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0304397501000056/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/W1985498227.pdf","grobid_xml":"https://content.openalex.org/works/W1985498227.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W29844495","https://openalex.org/W788200807","https://openalex.org/W1500165591","https://openalex.org/W1530753374","https://openalex.org/W1576498301","https://openalex.org/W2011039300","https://openalex.org/W2050272710","https://openalex.org/W2081254453","https://openalex.org/W2085725603","https://openalex.org/W2143466467","https://openalex.org/W2162328434","https://openalex.org/W2799004609","https://openalex.org/W2905110430","https://openalex.org/W3141099550"],"related_works":["https://openalex.org/W1586572182","https://openalex.org/W830096938","https://openalex.org/W2109606716","https://openalex.org/W2030292806","https://openalex.org/W2189202191","https://openalex.org/W2177346860","https://openalex.org/W1603360336","https://openalex.org/W1903582155","https://openalex.org/W2943623134","https://openalex.org/W2494523064"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}