{"id":"https://openalex.org/W1746344237","doi":"https://doi.org/10.1109/icppw.2002.1039757","title":"Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique","display_name":"Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1746344237","doi":"https://doi.org/10.1109/icppw.2002.1039757","mag":"1746344237"},"language":"en","primary_location":{"id":"doi:10.1109/icppw.2002.1039757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2002.1039757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Parallel Processing Workshop","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/scopus2000/2721","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031627799","display_name":"Li-Jen Mao","orcid":null},"institutions":[{"id":"https://openalex.org/I13521601","display_name":"Yu Da University","ror":"https://ror.org/03bej0y93","country_code":"TW","type":"education","lineage":["https://openalex.org/I13521601"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Li-Jen Mao","raw_affiliation_strings":["Department of Information Management, Yuda Institute of Business Technology, Miaoli, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, Yuda Institute of Business Technology, Miaoli, Taiwan","institution_ids":["https://openalex.org/I13521601"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113770265","display_name":"Sheau-Dong Lang","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":"Sheau-Dong Lang","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Central Florida, Orlando, FL, USA","institution_ids":["https://openalex.org/I106165777"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031627799"],"corresponding_institution_ids":["https://openalex.org/I13521601"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.12679766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"123","issue":null,"first_page":"398","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9889000058174133,"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.9889000058174133,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/tree-traversal","display_name":"Tree traversal","score":0.6853764057159424},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6640506982803345},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.654032289981842},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5521942377090454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49274733662605286},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4915522038936615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4866960346698761},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4661698639392853},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.456308513879776},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43229299783706665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37090539932250977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33736661076545715},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22437691688537598},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07679665088653564}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6853764057159424},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6640506982803345},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.654032289981842},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5521942377090454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49274733662605286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4915522038936615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4866960346698761},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4661698639392853},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.456308513879776},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43229299783706665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37090539932250977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33736661076545715},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22437691688537598},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07679665088653564},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icppw.2002.1039757","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icppw.2002.1039757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Parallel Processing Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:stars.library.ucf.edu:scopus2000-3720","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2000/2721","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 2000s","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:scopus2000-3720","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2000/2721","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 2000s","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W46406474","https://openalex.org/W1508221111","https://openalex.org/W1560173509","https://openalex.org/W1655990431","https://openalex.org/W1971782520","https://openalex.org/W1973942323","https://openalex.org/W1995670816","https://openalex.org/W2002764437","https://openalex.org/W2005954884","https://openalex.org/W2009803313","https://openalex.org/W2011039300","https://openalex.org/W2014340938","https://openalex.org/W2017127755","https://openalex.org/W2022563199","https://openalex.org/W2032527321","https://openalex.org/W2033983963","https://openalex.org/W2058748455","https://openalex.org/W2079200160","https://openalex.org/W2120092569","https://openalex.org/W2150580621","https://openalex.org/W4253639210","https://openalex.org/W6677694136"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"The":[0],"degree-constrained":[1],"minimum":[2,11],"spanning":[3,12,118],"tree":[4,13,23],"(d-MST)":[5],"problem":[6],"attempts":[7],"to":[8],"find":[9],"a":[10,25,29,121,138],"with":[14,120],"an":[15],"added":[16],"constraint":[17],"that":[18,36,109,127,143,163],"no":[19],"nodes":[20],"in":[21,45,72,173],"the":[22,38,46,60,73,88,91,111,146,164,168,176],"have":[24,69,76],"degree":[26],"larger":[27],"than":[28,126],"specified":[30],"integer":[31],"d.":[32],"It":[33],"is":[34,40],"known":[35],"computing":[37],"d-MST":[39,89],"NP-hard":[41],"for":[42,86],"every":[43],"d":[44,51],"range":[47],"2":[48],"/spl":[49,52],"les/":[50,53],"(n":[54],"-":[55],"2),":[56],"where":[57],"n":[58],"denotes":[59],"total":[61],"number":[62],"of":[63,99,128,149,175],"nodes.":[64],"Several":[65],"approximate":[66,80,171],"algorithms":[67,115,172],"(heuristics)":[68],"been":[70],"proposed":[71,78],"literature.":[74],"We":[75,136],"previously":[77],"three":[79],"algorithms,":[81],"IR,":[82,129],"TC-RNN,":[83],"and":[84,95,102,113,151,179],"TC-NNC,":[85],"solving":[87],"problem,":[90],"last":[92],"two":[93,170],"(TC-RNN":[94],"TC-NNC)":[96],"take":[97],"advantage":[98],"nearest":[100],"neighbors":[101],"their":[103],"properties.":[104],"Our":[105,153],"experimental":[106],"results":[107],"showed":[108],"both":[110],"TC-RNN":[112,150],"TC-NNC":[114,165],"consistently":[116],"produce":[117],"trees":[119],"smaller":[122],"weight":[123],"(better":[124],"quality-of-solution)":[125],"but":[130],"using":[131,155],"slightly":[132],"longer":[133],"execution":[134,177],"time.":[135],"propose":[137],"new":[139],"heap":[140],"traversal":[141],"technique":[142],"further":[144],"improves":[145],"time":[147,178],"efficiency":[148],"TC-NNC.":[152],"experiments":[154],"randomly":[156],"generated,":[157],"weighted":[158],"graphs":[159],"as":[160],"inputs":[161],"show":[162],"algorithm":[166],"outperforms":[167],"other":[169],"terms":[174],"quality-of-solution.":[180]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}