{"id":"https://openalex.org/W2141035180","doi":"https://doi.org/10.1109/iscas.2008.4541790","title":"Timing-driven X-architecture router among rectangular obstacles","display_name":"Timing-driven X-architecture router among rectangular obstacles","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2141035180","doi":"https://doi.org/10.1109/iscas.2008.4541790","mag":"2141035180"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2008.4541790","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2008.4541790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5064988755","display_name":"Hsin\u2010Hsiung Huang","orcid":"https://orcid.org/0000-0001-7150-7229"},"institutions":[{"id":"https://openalex.org/I151221077","display_name":"Chung Yuan Christian University","ror":"https://ror.org/02w8ws377","country_code":"TW","type":"education","lineage":["https://openalex.org/I151221077"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsin-Hsiung Huang","raw_affiliation_strings":["Dept. of Electronic Engineering, Chung Yuan Christian University, Chung Li, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Engineering, Chung Yuan Christian University, Chung Li, China","institution_ids":["https://openalex.org/I151221077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032263076","display_name":"Shu-Ping Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I151221077","display_name":"Chung Yuan Christian University","ror":"https://ror.org/02w8ws377","country_code":"TW","type":"education","lineage":["https://openalex.org/I151221077"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shu-Ping Chang","raw_affiliation_strings":["Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, China","institution_ids":["https://openalex.org/I151221077"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101685930","display_name":"Yu\u2010Cheng Lin","orcid":"https://orcid.org/0000-0001-6112-3723"},"institutions":[{"id":"https://openalex.org/I174748290","display_name":"Kainan University","ror":"https://ror.org/018p1hd91","country_code":"TW","type":"education","lineage":["https://openalex.org/I174748290"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yu-Cheng Lin","raw_affiliation_strings":["Dept. of Information and Electronic Commerce, Kainan University, Taoyuan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information and Electronic Commerce, Kainan University, Taoyuan, China","institution_ids":["https://openalex.org/I174748290"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108416600","display_name":"Tsai\u2010Ming Hsieh","orcid":null},"institutions":[{"id":"https://openalex.org/I151221077","display_name":"Chung Yuan Christian University","ror":"https://ror.org/02w8ws377","country_code":"TW","type":"education","lineage":["https://openalex.org/I151221077"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsai-Ming Hsieh","raw_affiliation_strings":["Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, China","institution_ids":["https://openalex.org/I151221077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3814,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71057757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1804","last_page":"1807"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8185540437698364},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.7950135469436646},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7140183448791504},{"id":"https://openalex.org/keywords/elmore-delay","display_name":"Elmore delay","score":0.6922833323478699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5982819199562073},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5869585275650024},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5430646538734436},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5398035049438477},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5334466099739075},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.5329906344413757},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5207067131996155},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4608677327632904},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4360452890396118},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4192376136779785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3671038746833801},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3406469225883484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28190380334854126},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25704652070999146},{"id":"https://openalex.org/keywords/delay-calculation","display_name":"Delay calculation","score":0.225029855966568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21704629063606262},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2079487144947052},{"id":"https://openalex.org/keywords/propagation-delay","display_name":"Propagation delay","score":0.20645245909690857},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17634430527687073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16348442435264587},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16155225038528442},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.15279620885849}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8185540437698364},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.7950135469436646},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7140183448791504},{"id":"https://openalex.org/C84434228","wikidata":"https://www.wikidata.org/wiki/Q4531332","display_name":"Elmore delay","level":4,"score":0.6922833323478699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5982819199562073},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5869585275650024},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5430646538734436},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5398035049438477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5334466099739075},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5329906344413757},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5207067131996155},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4608677327632904},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4360452890396118},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4192376136779785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3671038746833801},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3406469225883484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28190380334854126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25704652070999146},{"id":"https://openalex.org/C174086752","wikidata":"https://www.wikidata.org/wiki/Q5253471","display_name":"Delay calculation","level":3,"score":0.225029855966568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21704629063606262},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2079487144947052},{"id":"https://openalex.org/C90806461","wikidata":"https://www.wikidata.org/wiki/Q1144416","display_name":"Propagation delay","level":2,"score":0.20645245909690857},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17634430527687073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16348442435264587},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16155225038528442},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.15279620885849},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2008.4541790","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2008.4541790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1672562496","https://openalex.org/W1839012397","https://openalex.org/W1984588379","https://openalex.org/W1991381307","https://openalex.org/W2011024254","https://openalex.org/W2078144752","https://openalex.org/W2080879057","https://openalex.org/W2108210698","https://openalex.org/W2118095775","https://openalex.org/W2126950153","https://openalex.org/W2133527739","https://openalex.org/W2137937530","https://openalex.org/W2141270153","https://openalex.org/W2144677702","https://openalex.org/W2151807819","https://openalex.org/W2161510970","https://openalex.org/W2167966310","https://openalex.org/W2168008340","https://openalex.org/W4232765531","https://openalex.org/W4241328886","https://openalex.org/W4244590348","https://openalex.org/W4250691508","https://openalex.org/W6679799802","https://openalex.org/W6680400267","https://openalex.org/W6685076165"],"related_works":["https://openalex.org/W2183553443","https://openalex.org/W2943635264","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W2518240130","https://openalex.org/W1981480054","https://openalex.org/W2949081670","https://openalex.org/W2144570496","https://openalex.org/W1503036335","https://openalex.org/W2068598660"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,33,56],"formulate":[4],"a":[5,16,35,45,52,58,62,79,101],"timing-driven":[6,17],"obstacle-avoiding":[7],"X-architecture":[8,64],"Steiner":[9],"minimal":[10,46],"tree":[11,19,48,60],"(TOA-XSMT)":[12],"problem,":[13],"and":[14,28,41,112],"propose":[15],"routing":[18,72],"construction":[20],"which":[21,96],"simultaneously":[22],"minimizes":[23],"the":[24,29,39,42,71,74,105,117,121,130],"maximum":[25,122],"source-to-terminal":[26,123],"delay":[27,75,82,98,124],"total":[30,133],"wirelength.":[31,134],"First,":[32],"construct":[34],"spanning":[36,47,53,59],"graph":[37],"by":[38,78,110,127],"terminals":[40,107],"obstacles.":[43],"Second,":[44],"is":[49,76,89,125],"obtained":[50],"in":[51],"graph.":[54],"Third,":[55],"transform":[57],"into":[61],"feasible":[63],"tree.":[65],"Fourth,":[66],"for":[67],"each":[68],"terminal":[69],"of":[70],"tree,":[73],"computed":[77],"modified":[80],"Elmore":[81],"model.":[83],"Fifth,":[84],"an":[85],"efficient":[86],"rerouting":[87],"method":[88],"used":[90],"to":[91,116],"improve":[92],"all":[93],"timing":[94],"violations":[95],"their":[97],"are":[99,108],"over":[100],"user-defined":[102],"threshold.":[103],"Finally,":[104],"critical":[106],"rerouted":[109],"splitting":[111],"merging":[113],"procedure.":[114],"Compared":[115],"result":[118],"without":[119],"rerouting,":[120],"reduced":[126],"60.8%":[128],"with":[129],"0.7%":[131],"additional":[132]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}