{"id":"https://openalex.org/W15739268","doi":"https://doi.org/10.1007/978-3-319-03756-1_8","title":"An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem","display_name":"An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W15739268","doi":"https://doi.org/10.1007/978-3-319-03756-1_8","mag":"15739268"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-03756-1_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03756-1_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5108363610","display_name":"V. Venkata Ramana Murthy","orcid":null},"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":"V. Venkata Ramana Murthy","raw_affiliation_strings":["School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India"],"affiliations":[{"raw_affiliation_string":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"last","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":false,"raw_author_name":"Alok Singh","raw_affiliation_strings":["School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India"],"affiliations":[{"raw_affiliation_string":"School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India","institution_ids":["https://openalex.org/I36893310"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108363610"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3685,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85762467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9952999949455261,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7889154553413391},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7828254699707031},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6989614963531494},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.6598590612411499},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6414785385131836},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6052584648132324},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6050121188163757},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5515697002410889},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.510470986366272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5035194754600525},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.46460670232772827},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4523703157901764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4433629512786865},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.42228034138679504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4135358929634094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32887476682662964},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2833057641983032},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17423194646835327},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07766154408454895}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7889154553413391},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7828254699707031},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6989614963531494},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.6598590612411499},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6414785385131836},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6052584648132324},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6050121188163757},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5515697002410889},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.510470986366272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5035194754600525},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.46460670232772827},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4523703157901764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4433629512786865},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.42228034138679504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4135358929634094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32887476682662964},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2833057641983032},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17423194646835327},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07766154408454895},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-03756-1_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03756-1_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1545167657","https://openalex.org/W1573676079","https://openalex.org/W1996953491","https://openalex.org/W2010300491","https://openalex.org/W2020381385","https://openalex.org/W2021438403","https://openalex.org/W2044793578","https://openalex.org/W2049287714","https://openalex.org/W2060095317","https://openalex.org/W2074495456","https://openalex.org/W2078732543","https://openalex.org/W2088797223","https://openalex.org/W2107941094","https://openalex.org/W2147411825","https://openalex.org/W2158280690","https://openalex.org/W4292408555"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W2384589661","https://openalex.org/W3081212354","https://openalex.org/W2126785038","https://openalex.org/W2518240130","https://openalex.org/W2043113141","https://openalex.org/W2348803399","https://openalex.org/W2281826919","https://openalex.org/W2010585027","https://openalex.org/W1576317141"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}