{"id":"https://openalex.org/W3147275177","doi":"https://doi.org/10.1109/aspdac.2011.5722246","title":"Efficient multi-layer obstacle-avoiding preferred direction rectilinear Steiner tree construction","display_name":"Efficient multi-layer obstacle-avoiding preferred direction rectilinear Steiner tree construction","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W3147275177","doi":"https://doi.org/10.1109/aspdac.2011.5722246","mag":"3147275177"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2011.5722246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-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/A5023693185","display_name":"Jia-Ru Chuang","orcid":null},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Jia-Ru Chuang","raw_affiliation_strings":["Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091146878","display_name":"Jai-Ming Lin","orcid":"https://orcid.org/0000-0001-8637-2144"},"institutions":[{"id":"https://openalex.org/I91807558","display_name":"National Cheng Kung University","ror":"https://ror.org/01b8kcc49","country_code":"TW","type":"education","lineage":["https://openalex.org/I91807558"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jai-Ming Lin","raw_affiliation_strings":["Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan","institution_ids":["https://openalex.org/I91807558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023693185"],"corresponding_institution_ids":["https://openalex.org/I91807558"],"apc_list":null,"apc_paid":null,"fwci":0.5299,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73637886,"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":"527","last_page":"532"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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":1.0,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9987999796867371,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9373840093612671},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6902135610580444},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6419100165367126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6110665202140808},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5434505939483643},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.5220113396644592},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5050104260444641},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4919714629650116},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4916456341743469},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4908354878425598},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4841342866420746},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4466257691383362},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4351791739463806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43373245000839233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3637027144432068},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2896730303764343},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2586367726325989},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12184175848960876},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10519209504127502}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9373840093612671},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6902135610580444},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6419100165367126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6110665202140808},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5434505939483643},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.5220113396644592},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5050104260444641},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4919714629650116},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4916456341743469},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4908354878425598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4841342866420746},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4466257691383362},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4351791739463806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43373245000839233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3637027144432068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2896730303764343},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2586367726325989},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12184175848960876},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10519209504127502},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2011.5722246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1977187766","https://openalex.org/W1988944768","https://openalex.org/W2020112047","https://openalex.org/W2028847061","https://openalex.org/W2054452185","https://openalex.org/W2069712919","https://openalex.org/W2108634208","https://openalex.org/W2132627508","https://openalex.org/W2170811771","https://openalex.org/W4233540043","https://openalex.org/W6678839516"],"related_works":["https://openalex.org/W4236115276","https://openalex.org/W2156728385","https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W2039706936","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W2503538928"],"abstract_inverted_index":{"Constructing":[0],"rectilinear":[1,76],"Steiner":[2,77],"trees":[3],"for":[4,12,149],"signal":[5],"nets":[6,25],"is":[7,101],"a":[8,108,124,129,139,146,161],"very":[9,109],"important":[10],"procedure":[11],"placement":[13],"and":[14,26,51,90,93,111,127,152,177],"routing":[15,41,44,55],"because":[16],"we":[17,106,143],"can":[18],"use":[19],"it":[20],"to":[21,70,96,114,132],"find":[22,128],"topologies":[23],"of":[24,87,141],"measure":[27],"the":[28,85,88,99],"design":[29],"quality.":[30],"However,":[31],"in":[32,39],"modern":[33],"VLSI":[34],"designs,":[35],"pins":[36,159],"are":[37],"located":[38],"multiple":[40],"layers,":[42],"each":[43],"layer":[45],"has":[46,172],"its":[47],"own":[48],"preferred":[49,74],"direction,":[50],"there":[52],"exist":[53],"numerous":[54],"obstacles":[56],"incurred":[57],"from":[58],"IP":[59],"blocks,":[60],"power":[61],"networks,":[62],"pre-routed":[63],"nets,":[64],"etc,":[65],"which":[66,137],"make":[67],"us":[68],"need":[69],"consider":[71],"multilayer":[72],"obstacle-avoiding":[73],"direction":[75],"minimal":[78],"tree":[79,131],"(ML-OAPDRSMT)":[80],"problem.":[81,118],"This":[82],"significantly":[83],"increases":[84],"complexity":[86],"problem,":[89,136],"an":[91],"efficient":[92],"effective":[94,112],"algorithm":[95],"deal":[97,115,133],"with":[98,116,134,185],"problem":[100],"desired.":[102],"In":[103],"this":[104,135],"paper,":[105],"propose":[107],"simple":[110],"approach":[113],"ML-OAPDRSMT":[117],"Unlike":[119],"previous":[120],"works":[121],"usually":[122],"build":[123],"spanning":[125,130],"graph":[126],"takes":[138],"lot":[140],"time,":[142],"first":[144],"determine":[145],"connection":[147],"ordering":[148],"all":[150],"pins,":[151],"then":[153],"iteratively":[154],"connect":[155],"every":[156],"two":[157],"neighboring":[158],"by":[160],"greedy":[162],"heuristic":[163],"algorithm.":[164],"The":[165],"experimental":[166],"results":[167],"show":[168],"that":[169],"our":[170],"method":[171],"average":[173],"5.78%":[174],"improvement":[175],"over":[176],"at":[178],"least":[179],"five":[180],"times":[181],"speed":[182],"up":[183],"comparing":[184],"their":[186],"approach.":[187]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}