{"id":"https://openalex.org/W2165666764","doi":"https://doi.org/10.1145/2576768.2598237","title":"Revised analysis of the (1+1) ea for the minimum spanning tree problem","display_name":"Revised analysis of the (1+1) ea for the minimum spanning tree problem","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W2165666764","doi":"https://doi.org/10.1145/2576768.2598237","mag":"2165666764"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598237","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Carsten Witt","raw_affiliation_strings":["Technical University of Denmark, Kgs. Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kgs. Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038689623"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":1.266,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.85903269,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9957000017166138,"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.9937999844551086,"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/combinatorics","display_name":"Combinatorics","score":0.803779125213623},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7852250933647156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6144992709159851},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5636181831359863},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5542697310447693},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4833773970603943},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45575398206710815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41825202107429504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39665982127189636},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0649157464504242}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.803779125213623},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7852250933647156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6144992709159851},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5636181831359863},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5542697310447693},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4833773970603943},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45575398206710815},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41825202107429504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39665982127189636},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0649157464504242}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2576768.2598237","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/0e8ebf72-43f5-49f8-9de5-d0e437ea9f28","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/0e8ebf72-43f5-49f8-9de5-d0e437ea9f28","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Witt , C 2014 , Revised analysis of the (1+1) EA for the minimum spanning tree problem . in Proceedings of the 2014 conference on Genetic and evolutionary computation (GECCO '14) . Association for Computing Machinery , pp. 509-516 , 2014 Genetic and Evolutionary Computation Conference , Vancouver , British Columbia , Canada , 12/07/2014 . https://doi.org/10.1145/2576768.2598237","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1581232621","https://openalex.org/W1596384364","https://openalex.org/W1605768620","https://openalex.org/W1632066424","https://openalex.org/W1793635223","https://openalex.org/W1843453084","https://openalex.org/W1963865903","https://openalex.org/W2002970881","https://openalex.org/W2027881843","https://openalex.org/W2042401648","https://openalex.org/W2061751517","https://openalex.org/W2082187727","https://openalex.org/W2100137329","https://openalex.org/W2101034509","https://openalex.org/W2102044362","https://openalex.org/W2153401898","https://openalex.org/W2499441210","https://openalex.org/W3100597221","https://openalex.org/W3122779104"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0],"revisit":[1],"the":[2,6,10,16,23,26,30,35,52,56,90,96,107,118,122,126,142,153,162],"classical":[3,143],"analysis":[4,165],"of":[5,25,55,59,82,92,98,121,125,135,161],"(1+1)":[7],"EA":[8],"for":[9],"minimum":[11],"spanning":[12],"tree":[13],"problem":[14],"in":[15,68],"case":[17,70],"that":[18],"nothing":[19],"is":[20,58,71,81,89,117,129,157],"known":[21],"about":[22],"weights":[24],"underlying":[27],"graph.":[28,127],"Here":[29],"original":[31],"upper":[32,64],"bound":[33,65,109,154],"on":[34,51],"expected":[36],"running":[37],"time":[38],"by":[39,131],"Neumann":[40],"and":[41,75,80,94,159],"Wegener":[42],"[Theor.":[43],"Comput.":[44],"Sci.":[45],"378(1),":[46],"32-40,":[47],"2007],":[48],"which":[49],"depends":[50],"largest":[53],"weight":[54],"graph,":[57],"no":[60],"use.":[61],"The":[62],"best":[63],"available":[66],"before":[67],"this":[69],"due":[72],"to":[73,152],"Reichel":[74],"Skutella":[76],"[FOGA":[77],"2009,":[78],"21-28]":[79],"order":[83],"O(m3":[84],"\\log":[85,113],"n),":[86],"where":[87,115],"m":[88],"number":[91,97],"edges":[93],"n":[95,139],"vertices.":[99],"Using":[100],"an":[101,132,147],"adaptive":[102,163],"drift":[103,164],"analysis,":[104],"we":[105],"show":[106],"improved":[108],"O(m2":[110],"(sqrt{c(G)}":[111],"+":[112],"n)),":[114],"c(G)":[116],"circumference":[119],"(length":[120],"longest":[123],"cycle)":[124],"This":[128],"only":[130],"asymptotic":[133],"factor":[134],"at":[136],"most":[137],"sqrt{n}/\\log":[138],"away":[140],"from":[141],"lower":[144],"bound.":[145],"Furthermore,":[146],"alternative":[148],"fitness":[149],"function":[150],"leading":[151],"O(m2\\log":[155],"n)":[156],"proposed,":[158],"limitations":[160],"are":[166],"pointed":[167],"out.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}