{"id":"https://openalex.org/W2105361752","doi":"https://doi.org/10.1109/tcad.2008.2006085","title":"A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem","display_name":"A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem","publication_year":2008,"publication_date":"2008-10-22","ids":{"openalex":"https://openalex.org/W2105361752","doi":"https://doi.org/10.1109/tcad.2008.2006085","mag":"2105361752"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2008.2006085","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2008.2006085","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11511/57098","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5097148215","display_name":"Serta\u00c7 Cinel","orcid":null},"institutions":[{"id":"https://openalex.org/I56303344","display_name":"Aselsan (Turkey)","ror":"https://ror.org/04knh8e66","country_code":"TR","type":"company","lineage":["https://openalex.org/I56303344"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Serta\u00c7 Cinel","raw_affiliation_strings":["ASELSAN, Inc., Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ASELSAN, Inc., Ankara, Turkey","institution_ids":["https://openalex.org/I56303344"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033658789","display_name":"C\u00fcneyt F. Bazlama\u00e7c\u0131","orcid":"https://orcid.org/0000-0001-8329-5147"},"institutions":[{"id":"https://openalex.org/I201799495","display_name":"Middle East Technical University","ror":"https://ror.org/014weej12","country_code":"TR","type":"education","lineage":["https://openalex.org/I201799495"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"C\u00dcneyt F. Bazlamacci","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Middle East Technical University, Ankara, Turkey","institution_ids":["https://openalex.org/I201799495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3359,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.65064376,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"11","first_page":"2083","last_page":"2087"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9746999740600586,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.90133136510849},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6678021550178528},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5810458660125732},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5793529748916626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.571086049079895},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5529727935791016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.512843668460846},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4875630736351013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3863331079483032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31381702423095703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25256669521331787},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2305258810520172}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.90133136510849},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6678021550178528},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5810458660125732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5793529748916626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.571086049079895},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5529727935791016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.512843668460846},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4875630736351013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3863331079483032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31381702423095703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25256669521331787},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2305258810520172},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcad.2008.2006085","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2008.2006085","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"},{"id":"pmh:oai:open.metu.edu.tr:11511/57098","is_oa":true,"landing_page_url":"https://hdl.handle.net/11511/57098","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:open.metu.edu.tr:11511/57098","is_oa":true,"landing_page_url":"https://hdl.handle.net/11511/57098","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W18443343","https://openalex.org/W1508240458","https://openalex.org/W1965680834","https://openalex.org/W2012130001","https://openalex.org/W2016523183","https://openalex.org/W2020112047","https://openalex.org/W2026175709","https://openalex.org/W2056839231","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2078144752","https://openalex.org/W2125831674","https://openalex.org/W2133484570","https://openalex.org/W2135498565","https://openalex.org/W2137962804","https://openalex.org/W2151559976","https://openalex.org/W4232765531","https://openalex.org/W4253543134","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"Rectilinear":[0],"Steiner":[1],"minimal":[2],"tree":[3,10,49],"(RSMT)":[4],"problem":[5,132],"finds":[6],"a":[7,13,68,76,79,83,115],"minimum":[8],"length":[9],"that":[11],"interconnects":[12],"given":[14],"set":[15],"of":[16,89,106,117],"points":[17,29],"by":[18,26,51,58],"only":[19],"horizontal":[20],"and":[21,25,53,78,86,111],"vertical":[22],"line":[23],"segments":[24],"using":[27,97],"extra":[28],"if":[30],"necessary.":[31],"In":[32],"this":[33,90],"paper,":[34],"to":[35,75,125],"speedup":[36],"the":[37,65,104,107,121],"RSMT":[38],"construction,":[39],"two":[40],"recently":[41],"developed":[42],"successful":[43],"heuristic":[44],"algorithms,":[45],"namely":[46],"rectilinear":[47],"steiner":[48],"(RST)":[50],"Zhou":[52],"batched":[54],"greedy":[55],"algorithm":[56,92],"(BGA)":[57],"Kahng":[59],",":[60],"have":[61,102,119],"been":[62],"used":[63],"as":[64],"basis.":[66],"Following":[67],"slight":[69],"modification":[70,108],"on":[71,109,114],"RST,":[72,110],"which":[73],"led":[74],"nonrecursive":[77],"considerably":[80],"faster":[81],"version,":[82],"partially":[84],"parallelized":[85],"distributed":[87,123],"form":[88],"modified":[91],"is":[93],"proposed.":[94],"Computational":[95],"tests":[96,112],"large":[98,131],"random":[99],"data":[100],"sets":[101],"shown":[103],"advantage":[105],"conducted":[113],"cluster":[116],"workstations":[118],"proven":[120],"proposed":[122],"approach":[124],"be":[126],"very":[127],"promising":[128],"particularly":[129],"for":[130],"instances.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}