{"id":"https://openalex.org/W2159512835","doi":"https://doi.org/10.1162/evco_a_00047","title":"Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem","display_name":"Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem","publication_year":2011,"publication_date":"2011-08-12","ids":{"openalex":"https://openalex.org/W2159512835","doi":"https://doi.org/10.1162/evco_a_00047","mag":"2159512835","pmid":"https://pubmed.ncbi.nlm.nih.gov/21838552"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00047","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00047","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040561209","display_name":"Carola Doerr","orcid":"https://orcid.org/0000-0002-4981-3227"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Benjamin Doerr","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070819885","display_name":"Edda Happ","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Edda Happ","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070076122","display_name":"Christian Klein","orcid":"https://orcid.org/0000-0001-8702-2816"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christian Klein","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Campus E1 4, 66123 Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040561209","https://openalex.org/A5070076122","https://openalex.org/A5070819885"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":6.3014,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96795377,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"4","first_page":"673","last_page":"691"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7740786075592041},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6217790842056274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5845229625701904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.534740149974823},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5062805414199829},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44971761107444763},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42952635884284973},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4208759665489197},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4171363115310669},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3898196220397949},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3774474561214447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34279173612594604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3152579665184021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25410783290863037},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11464762687683105},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08329737186431885}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7740786075592041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6217790842056274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5845229625701904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.534740149974823},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5062805414199829},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44971761107444763},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42952635884284973},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4208759665489197},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4171363115310669},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3898196220397949},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3774474561214447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34279173612594604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3152579665184021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25410783290863037},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11464762687683105},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08329737186431885},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008433","descriptor_name":"Mathematics","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D008433","descriptor_name":"Mathematics","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D008433","descriptor_name":"Mathematics","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00047","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00047","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:21838552","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/21838552","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:edoc.mpg.de:618687","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618687","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Evolutionary Computation, v.19, 673-691 (2011)","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1488747864","https://openalex.org/W1491201910","https://openalex.org/W1510977876","https://openalex.org/W1522890465","https://openalex.org/W1559713164","https://openalex.org/W1606774760","https://openalex.org/W1781587470","https://openalex.org/W1781730958","https://openalex.org/W1981898306","https://openalex.org/W1995375333","https://openalex.org/W2027557853","https://openalex.org/W2068871408","https://openalex.org/W2075706745","https://openalex.org/W2136575369","https://openalex.org/W2153401898","https://openalex.org/W2156622046","https://openalex.org/W2165220807","https://openalex.org/W2165686220","https://openalex.org/W2169528473","https://openalex.org/W2295428206","https://openalex.org/W2496163386","https://openalex.org/W4234274482"],"related_works":["https://openalex.org/W2739612537","https://openalex.org/W3121246613","https://openalex.org/W3166204570","https://openalex.org/W2132137594","https://openalex.org/W2349174696","https://openalex.org/W2360241746","https://openalex.org/W4313041667","https://openalex.org/W2767599893","https://openalex.org/W2798482732","https://openalex.org/W2381572297"],"abstract_inverted_index":{"We":[0,42,173],"conduct":[1],"a":[2,72,93,119,135,161],"rigorous":[3],"analysis":[4,184],"of":[5,25,36,87,107,128,142,152,165,168,185],"the":[6,11,48,58,69,103,124,166,169,183],"(1+1)":[7],"evolutionary":[8,26,186],"algorithm":[9],"for":[10,140,150],"single":[12],"source":[13,70],"shortest":[14,31,73],"path":[15,74],"problem":[16],"proposed":[17],"by":[18],"Scharnow,":[19],"Tinnefeld,":[20],"and":[21,30,39,89,148],"Wegener":[22],"(The":[23],"analyses":[24],"algorithms":[27],"on":[28],"sorting":[29],"paths":[32],"problems,":[33],"2004,":[34],"Journal":[35],"Mathematical":[37],"Modelling":[38],"Algorithms,":[40],"3(4):349-366).":[41],"prove":[43],"that":[44,62,122,155,176],"with":[45,95,100],"high":[46,101],"probability,":[47,102],"optimization":[49,104],"time":[50,105],"is":[51,57,82,106],"O(n2":[52],"max{\u2113,":[53,110],"log(n)}),":[54],"where":[55],"\u2113":[56,78,90],"smallest":[59],"integer":[60],"such":[61,98,114],"any":[63],"vertex":[64],"can":[65],"be":[66],"reached":[67],"from":[68],"via":[71],"having":[75],"at":[76],"most":[77],"edges.":[79],"This":[80],"bound":[81],"tight.":[83],"For":[84],"all":[85],"values":[86],"n":[88],"we":[91,117,133],"provide":[92],"graph":[94],"edge":[96],"weights":[97],"that,":[99],"order":[108],"\u03a9(n2":[109],"log(n)}).":[111],"To":[112],"obtain":[113],"sharp":[115],"bounds,":[116],"develop":[118],"new":[120],"technique":[121],"overcomes":[123],"coupon":[125],"collector":[126],"behavior":[127,163],"previously":[129],"used":[130],"arguments.":[131],"Also,":[132],"exhibit":[134],"simple":[136],"Chernoff":[137],"type":[138],"inequality":[139],"sums":[141],"independent":[143,164],"geometrically":[144],"distributed":[145],"random":[146,153,171],"variables,":[147],"one":[149],"sequences":[151],"variables":[154],"are":[156,174],"not":[157],"independent,":[158],"but":[159],"show":[160],"desired":[162],"outcomes":[167],"previous":[170],"variables.":[172],"optimistic":[175],"these":[177],"tools":[178],"find":[179],"further":[180],"applications":[181],"in":[182],"algorithms.":[187]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}