{"id":"https://openalex.org/W2014340938","doi":"https://doi.org/10.1016/0167-8191(95)00010-0","title":"Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine","display_name":"Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2014340938","doi":"https://doi.org/10.1016/0167-8191(95)00010-0","mag":"2014340938"},"language":"en","primary_location":{"id":"doi:10.1016/0167-8191(95)00010-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(95)00010-0","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"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":"Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/facultybib1990/1551","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030285662","display_name":"Bruce Boldon","orcid":null},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bruce Boldon","raw_affiliation_strings":["Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108559244","display_name":"Narsingh Deo","orcid":null},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Narsingh Deo","raw_affiliation_strings":["Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071324620","display_name":"Nishit Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nishit Kumar","raw_affiliation_strings":["Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Central Florida, Orlando, FL 32816-2362, USA","institution_ids":["https://openalex.org/I106165777"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071324620"],"corresponding_institution_ids":["https://openalex.org/I106165777"],"apc_list":{"value":2680,"currency":"USD","value_usd":2680},"apc_paid":null,"fwci":3.4881,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.90962099,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"3","first_page":"369","last_page":"382"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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.7567869424819946},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7264115810394287},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6887187361717224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6123884320259094},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5877808928489685},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4712819457054138},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46795332431793213},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.46393588185310364},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4493761360645294},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4449140429496765},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4443782866001129},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43726587295532227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.333091676235199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.327514111995697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30671483278274536},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27662813663482666}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7567869424819946},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7264115810394287},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6887187361717224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6123884320259094},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5877808928489685},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4712819457054138},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46795332431793213},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.46393588185310364},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4493761360645294},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4449140429496765},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4443782866001129},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43726587295532227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.333091676235199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.327514111995697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30671483278274536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27662813663482666},{"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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0167-8191(95)00010-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-8191(95)00010-0","pdf_url":null,"source":{"id":"https://openalex.org/S112708030","display_name":"Parallel Computing","issn_l":"0167-8191","issn":["0167-8191","1872-7336"],"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":"Parallel Computing","raw_type":"journal-article"},{"id":"pmh:oai:stars.library.ucf.edu:facultybib1990-2550","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/facultybib1990/1551","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Bibliography 1990s","raw_type":"text"},{"id":"pmh:oai:stars.library.ucf.edu:scopus1990-3333","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus1990/2334","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 1990s","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:facultybib1990-2550","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/facultybib1990/1551","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Bibliography 1990s","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W195603874","https://openalex.org/W1508221111","https://openalex.org/W1576747601","https://openalex.org/W1593663058","https://openalex.org/W1967957610","https://openalex.org/W1968867315","https://openalex.org/W1977545325","https://openalex.org/W1990039347","https://openalex.org/W2002764437","https://openalex.org/W2011039300","https://openalex.org/W2014340938","https://openalex.org/W2016688797","https://openalex.org/W2019235922","https://openalex.org/W2022179164","https://openalex.org/W2022563199","https://openalex.org/W2055114648","https://openalex.org/W2056975974","https://openalex.org/W2072970829","https://openalex.org/W2074417667","https://openalex.org/W2087216833","https://openalex.org/W2151466579","https://openalex.org/W2163428398","https://openalex.org/W2400451530","https://openalex.org/W2752885492","https://openalex.org/W2956015669","https://openalex.org/W3191415409","https://openalex.org/W4253639210","https://openalex.org/W6635525525","https://openalex.org/W6653785497","https://openalex.org/W6682608799","https://openalex.org/W6980168144"],"related_works":["https://openalex.org/W2146459980","https://openalex.org/W2014991506","https://openalex.org/W4220861011","https://openalex.org/W2157421865","https://openalex.org/W3024690918","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2090857456","https://openalex.org/W1997570556","https://openalex.org/W2074417667"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}