{"id":"https://openalex.org/W2117212290","doi":"https://doi.org/10.1145/1143997.1144097","title":"An effective genetic algorithm for the minimum-label spanning tree problem","display_name":"An effective genetic algorithm for the minimum-label spanning tree problem","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2117212290","doi":"https://doi.org/10.1145/1143997.1144097","mag":"2117212290"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th 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/A5037550852","display_name":"Jeremiah Nummela","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeremiah Nummela","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073112856","display_name":"Bryant A. Julstrom","orcid":null},"institutions":[{"id":"https://openalex.org/I173963315","display_name":"St. Cloud State University","ror":"https://ror.org/016czhx14","country_code":"US","type":"education","lineage":["https://openalex.org/I173963315","https://openalex.org/I91221267"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bryant A. Julstrom","raw_affiliation_strings":["St. Cloud State University, St. Cloud, MN","St. Cloud State University , St. Cloud, MN"],"affiliations":[{"raw_affiliation_string":"St. Cloud State University, St. Cloud, MN","institution_ids":["https://openalex.org/I173963315"]},{"raw_affiliation_string":"St. Cloud State University , St. Cloud, MN","institution_ids":["https://openalex.org/I173963315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037550852"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.3972,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85224174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"553","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9947999715805054,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9684000015258789,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7918353080749512},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7633235454559326},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7497072219848633},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6875746846199036},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.61553955078125},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5988019108772278},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5887697339057922},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5472317934036255},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5138242840766907},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49047133326530457},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48824194073677063},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4684353470802307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4657374918460846},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.4647568464279175},{"id":"https://openalex.org/keywords/chromosome","display_name":"Chromosome","score":0.46059927344322205},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4452736973762512},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4446813464164734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.441336989402771},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43116313219070435},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4154853820800781},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24638140201568604}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7918353080749512},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7633235454559326},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7497072219848633},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6875746846199036},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.61553955078125},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5988019108772278},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5887697339057922},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5472317934036255},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5138242840766907},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49047133326530457},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48824194073677063},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4684353470802307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4657374918460846},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.4647568464279175},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.46059927344322205},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4452736973762512},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4446813464164734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.441336989402771},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43116313219070435},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4154853820800781},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24638140201568604},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1143997.1144097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.6397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.6397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p553.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.550.2293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.550.2293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.stcloudstate.edu/bajulstrom/ga_papers/gecco06mlstp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W32262330","https://openalex.org/W1512383952","https://openalex.org/W1589975099","https://openalex.org/W1997809628","https://openalex.org/W1998751027","https://openalex.org/W2048177396","https://openalex.org/W2095481180","https://openalex.org/W2117842753","https://openalex.org/W2602753196"],"related_works":["https://openalex.org/W2381121915","https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W3081212354","https://openalex.org/W2518240130","https://openalex.org/W2418231958","https://openalex.org/W1561849181","https://openalex.org/W2099915933"],"abstract_inverted_index":{"Given":[0],"a":[1,16,79,107,146],"connected,":[2],"undirected":[3],"graph":[4],"G":[5,20],"with":[6,131],"labeled":[7],"edges,":[8],"the":[9,26,46,51,63,72,82,87,90,96,118,125,134,142,150,158,170],"minimum":[10],"label":[11],"spanning":[12,17,120],"tree":[13,18,121],"problem":[14,38,64,159],"seeks":[15],"on":[19,86,113,164],"to":[21,44,157],"whose":[22],"edges":[23,88],"are":[24],"attached":[25],"smallest":[27],"possible":[28],"number":[29,47],"of":[30,48,71,77,95,117,124],"labels.":[31],"A":[32,59],"greedy":[33,143],"heuristic":[34,101],"for":[35,62],"this":[36],"NP-hard":[37],"greedily":[39],"chooses":[40],"labels":[41,83,168],"so":[42],"as":[43,55,57,68],"reduce":[45],"components":[49],"in":[50,89],"subgraphs":[52],"they":[53],"induce":[54],"quickly":[56],"possible.":[58],"genetic":[60],"algorithm":[61],"encodes":[65],"candidate":[66],"solutions":[67,161],"per":[69],"mutations":[70],"labels;":[73],"an":[74],"initial":[75],"segment":[76],"such":[78],"chromosome":[80],"lists":[81],"that":[84,127,148,162],"appear":[85],"chromosome's":[91],"tree.":[92],"Three":[93],"versions":[94,123],"GA":[97,126],"apply":[98,128],"generic":[99,129],"or":[100],"crossover":[102],"and":[103,106,132,154],"mutation":[104],"operators":[105,155],"local":[108,135,151],"search":[109,136,152],"step.":[110],"In":[111],"tests":[112],"27":[114],"randomly-generated":[115],"instances":[116],"minimum-label":[119],"problem,":[122],"operators,":[130],"without":[133],"step,":[137],"perform":[138],"less":[139],"well":[140],"than":[141,169],"heuristic,":[144],"but":[145],"version":[147],"applies":[149],"step":[153],"tailored":[156],"returns":[160],"require":[163],"average":[165],"10":[166],"fewer":[167],"heuristic's.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}