{"id":"https://openalex.org/W1989892093","doi":"https://doi.org/10.1145/1389095.1389217","title":"Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem","display_name":"Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem","publication_year":2008,"publication_date":"2008-07-12","ids":{"openalex":"https://openalex.org/W1989892093","doi":"https://doi.org/10.1145/1389095.1389217","mag":"1989892093"},"language":"en","primary_location":{"id":"doi:10.1145/1389095.1389217","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th 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/A5102942829","display_name":"Arindam Khaled","orcid":"https://orcid.org/0009-0000-1762-1688"},"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":true,"raw_author_name":"Arindam Khaled","raw_affiliation_strings":["St. Cloud State University, Saint Cloud, MN, USA"],"affiliations":[{"raw_affiliation_string":"St. Cloud State University, Saint Cloud, MN, USA","institution_ids":["https://openalex.org/I173963315"]}]},{"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, Saint Cloud, MN, USA"],"affiliations":[{"raw_affiliation_string":"St. Cloud State University, Saint Cloud, MN, USA","institution_ids":["https://openalex.org/I173963315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102942829"],"corresponding_institution_ids":["https://openalex.org/I173963315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13317691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"611","last_page":"612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9884999990463257,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9884999990463257,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9843000173568726,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9814000129699707,"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/spanning-tree","display_name":"Spanning tree","score":0.7992335557937622},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7634624242782593},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6803542971611023},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.67034912109375},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6632596850395203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6479178667068481},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6176630854606628},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.500946044921875},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4832897484302521},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4585241675376892},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4571203887462616},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.43610015511512756},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.43383997678756714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4324640929698944},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4241976737976074},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.411207377910614},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3662313222885132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2916721701622009},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28168535232543945}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7992335557937622},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7634624242782593},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6803542971611023},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.67034912109375},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6632596850395203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6479178667068481},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6176630854606628},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.500946044921875},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4832897484302521},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4585241675376892},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4571203887462616},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.43610015511512756},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.43383997678756714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4324640929698944},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4241976737976074},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.411207377910614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3662313222885132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2916721701622009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28168535232543945},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1389095.1389217","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389095.1389217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.8892","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.8892","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/gecco2008/docs/p611.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W99032621","https://openalex.org/W1965680834","https://openalex.org/W2048177396","https://openalex.org/W2117212290","https://openalex.org/W2117842753","https://openalex.org/W2156312014"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W2059360098","https://openalex.org/W4380840098","https://openalex.org/W2099915933","https://openalex.org/W2518240130","https://openalex.org/W2043113141","https://openalex.org/W3081212354","https://openalex.org/W2418231958"],"abstract_inverted_index":{"Given":[0],"an":[1],"edge-labeled,":[2],"connected,":[3],"undirected":[4],"graph":[5],"G":[6,22],"and":[7,30],"a":[8,18],"bound":[9],"r>1,":[10],"the":[11,26,44,48,53,60,77],"bounded":[12,54],"minimum-label":[13],"spanning":[14,19,64],"tree":[15,20],"problem":[16,49,61],"seeks":[17],"on":[21],"whose":[23],"edges":[24],"carry":[25],"fewest":[27],"possible":[28],"labels":[29],"in":[31],"which":[32],"no":[33],"label":[34],"appears":[35],"more":[36],"than":[37],"r":[38],"times.":[39],"Two":[40,56],"greedy":[41],"heuristics":[42],"for":[43,59],"unbounded":[45],"version":[46],"of":[47,68,79],"are":[50],"adapted":[51],"to":[52],"version.":[55],"genetic":[57],"algorithms":[58],"encode":[62],"labeled":[63],"trees":[65],"as":[66],"permutations":[67],"G's":[69],"edges.":[70],"A":[71],"simple":[72],"GA":[73],"performs":[74],"poorly,":[75],"but":[76],"addition":[78],"local":[80],"search":[81],"enables":[82],"consistently":[83],"good":[84],"results.":[85]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}