{"id":"https://openalex.org/W2078614936","doi":"https://doi.org/10.1007/s00500-006-0142-y","title":"Improved heuristics for the bounded-diameter minimum spanning tree problem","display_name":"Improved heuristics for the bounded-diameter minimum spanning tree problem","publication_year":2006,"publication_date":"2006-11-30","ids":{"openalex":"https://openalex.org/W2078614936","doi":"https://doi.org/10.1007/s00500-006-0142-y","mag":"2078614936"},"language":"en","primary_location":{"id":"doi:10.1007/s00500-006-0142-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-006-0142-y","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/I168893459","display_name":"University of Allahabad","ror":"https://ror.org/03vrx7m55","country_code":"IN","type":"education","lineage":["https://openalex.org/I168893459"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Alok Singh","raw_affiliation_strings":["J. K. Institute of Applied Physics and Technology, Faculty of Science, University of Allahabad, Allahabad, 211002, UP, India","University of Allahabad, J. K. Institute of Applied Physics and Technology, Faculty of Science, 211002, Allahabad, UP, India#TAB#"],"affiliations":[{"raw_affiliation_string":"J. K. Institute of Applied Physics and Technology, Faculty of Science, University of Allahabad, Allahabad, 211002, UP, India","institution_ids":["https://openalex.org/I168893459"]},{"raw_affiliation_string":"University of Allahabad, J. K. Institute of Applied Physics and Technology, Faculty of Science, 211002, Allahabad, UP, India#TAB#","institution_ids":["https://openalex.org/I168893459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078242974","display_name":"Ashok Kumar Gupta","orcid":"https://orcid.org/0000-0002-8996-2374"},"institutions":[{"id":"https://openalex.org/I168893459","display_name":"University of Allahabad","ror":"https://ror.org/03vrx7m55","country_code":"IN","type":"education","lineage":["https://openalex.org/I168893459"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ashok K. Gupta","raw_affiliation_strings":["J. K. Institute of Applied Physics and Technology, Faculty of Science, University of Allahabad, Allahabad, 211002, UP, India","University of Allahabad, J. K. Institute of Applied Physics and Technology, Faculty of Science, 211002, Allahabad, UP, India#TAB#"],"affiliations":[{"raw_affiliation_string":"J. K. Institute of Applied Physics and Technology, Faculty of Science, University of Allahabad, Allahabad, 211002, UP, India","institution_ids":["https://openalex.org/I168893459"]},{"raw_affiliation_string":"University of Allahabad, J. K. Institute of Applied Physics and Technology, Faculty of Science, 211002, Allahabad, UP, India#TAB#","institution_ids":["https://openalex.org/I168893459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045783983"],"corresponding_institution_ids":["https://openalex.org/I168893459"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":11.4578,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.98385957,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"10","first_page":"911","last_page":"921"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9954000115394592,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/spanning-tree","display_name":"Spanning tree","score":0.7941601276397705},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7367571592330933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5961955189704895},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5943781137466431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5789374113082886},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5494489073753357},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5440813899040222},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5340411067008972},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5174482464790344},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4895695149898529},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.46533647179603577},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45764416456222534},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44781753420829773},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42994561791419983},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.41155076026916504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3391636312007904},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0960192084312439}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7941601276397705},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7367571592330933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5961955189704895},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5943781137466431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5789374113082886},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5494489073753357},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5440813899040222},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5340411067008972},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5174482464790344},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4895695149898529},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.46533647179603577},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45764416456222534},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44781753420829773},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42994561791419983},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.41155076026916504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3391636312007904},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0960192084312439},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/s00500-006-0142-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00500-006-0142-y","pdf_url":null,"source":{"id":"https://openalex.org/S65753830","display_name":"Soft Computing","issn_l":"1432-7643","issn":["1432-7643","1433-7479"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1507484587","https://openalex.org/W1510935138","https://openalex.org/W1516301787","https://openalex.org/W1977712294","https://openalex.org/W2011039300","https://openalex.org/W2017927472","https://openalex.org/W2032257665","https://openalex.org/W2082810196","https://openalex.org/W2084512873","https://openalex.org/W2115831664","https://openalex.org/W2140470303","https://openalex.org/W2140606557","https://openalex.org/W2142146559","https://openalex.org/W2148250509","https://openalex.org/W2159991628","https://openalex.org/W2166775052","https://openalex.org/W2166843422","https://openalex.org/W2976664243","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W2381121915","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W3016811403","https://openalex.org/W1561849181","https://openalex.org/W3081212354","https://openalex.org/W2109692093","https://openalex.org/W2353025557"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}