{"id":"https://openalex.org/W2020381385","doi":"https://doi.org/10.1016/j.asoc.2008.09.001","title":"An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem","display_name":"An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem","publication_year":2008,"publication_date":"2008-09-10","ids":{"openalex":"https://openalex.org/W2020381385","doi":"https://doi.org/10.1016/j.asoc.2008.09.001","mag":"2020381385"},"language":"en","primary_location":{"id":"doi:10.1016/j.asoc.2008.09.001","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.asoc.2008.09.001","pdf_url":null,"source":{"id":"https://openalex.org/S140556538","display_name":"Applied Soft Computing","issn_l":"1568-4946","issn":["1568-4946","1872-9681"],"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":"Applied Soft Computing","raw_type":"journal-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/A5045783983","display_name":"Alok Singh","orcid":"https://orcid.org/0000-0003-3585-4957"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Alok Singh","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Hyderabad, Hyderabad 500046, Andhra Pradesh, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Hyderabad, Hyderabad 500046, Andhra Pradesh, India","institution_ids":["https://openalex.org/I36893310"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045783983"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":{"value":3350,"currency":"USD","value_usd":3350},"apc_paid":null,"fwci":40.2777,"has_fulltext":false,"cited_by_count":430,"citation_normalized_percentile":{"value":0.99819938,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"9","issue":"2","first_page":"625","last_page":"631"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9959999918937683,"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/T14119","display_name":"Agricultural and Environmental Management","score":0.9430000185966492,"subfield":{"id":"https://openalex.org/subfields/3317","display_name":"Demography"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.809221625328064},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7709923982620239},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6933380961418152},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.673688530921936},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6693084239959717},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.6487900018692017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.596454918384552},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.5766218304634094},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5654222369194031},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5386509895324707},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5250251889228821},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5147433280944824},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4755168557167053},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4749467670917511},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.4364880919456482},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.43231943249702454},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.42443180084228516},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4168386161327362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37528538703918457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3230225443840027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3081507980823517},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.20918744802474976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19928699731826782},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17033258080482483},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15946230292320251},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.12561574578285217},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06663516163825989}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.809221625328064},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7709923982620239},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6933380961418152},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.673688530921936},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6693084239959717},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.6487900018692017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.596454918384552},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.5766218304634094},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5654222369194031},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5386509895324707},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5250251889228821},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5147433280944824},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4755168557167053},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4749467670917511},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.4364880919456482},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.43231943249702454},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.42443180084228516},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4168386161327362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37528538703918457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3230225443840027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3081507980823517},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.20918744802474976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19928699731826782},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17033258080482483},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15946230292320251},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.12561574578285217},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06663516163825989}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.asoc.2008.09.001","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.asoc.2008.09.001","pdf_url":null,"source":{"id":"https://openalex.org/S140556538","display_name":"Applied Soft Computing","issn_l":"1568-4946","issn":["1568-4946","1872-9681"],"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":"Applied Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.5799999833106995,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2035683593","https://openalex.org/W2088797223","https://openalex.org/W2134816084","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2147411825","https://openalex.org/W2287814884","https://openalex.org/W3138355580","https://openalex.org/W6659531564","https://openalex.org/W6679782657","https://openalex.org/W6681878147","https://openalex.org/W6792741644"],"related_works":["https://openalex.org/W2390742649","https://openalex.org/W2943635264","https://openalex.org/W3081212354","https://openalex.org/W2130375301","https://openalex.org/W2281826919","https://openalex.org/W2353822696","https://openalex.org/W1587959445","https://openalex.org/W1576317141","https://openalex.org/W1965702747","https://openalex.org/W2361573941"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":31},{"year":2017,"cited_by_count":28},{"year":2016,"cited_by_count":28},{"year":2015,"cited_by_count":33},{"year":2014,"cited_by_count":54},{"year":2013,"cited_by_count":44},{"year":2012,"cited_by_count":48}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}