{"id":"https://openalex.org/W4242606774","doi":"https://doi.org/10.1109/iccad.2001.968597","title":"A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints","display_name":"A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints","publication_year":2002,"publication_date":"2002-11-13","ids":{"openalex":"https://openalex.org/W4242606774","doi":"https://doi.org/10.1109/iccad.2001.968597"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2001.968597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2001.968597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101680135","display_name":"Xiaoping Tang","orcid":"https://orcid.org/0000-0002-5067-659X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoping Tang","raw_affiliation_strings":["University of Technology, Austin, TX, USA","University of Texas at Austin, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102804565","display_name":"Ruiqi Tian","orcid":"https://orcid.org/0000-0003-1154-7119"},"institutions":[{"id":"https://openalex.org/I1333370159","display_name":"Motorola (United States)","ror":"https://ror.org/01hafxd32","country_code":"US","type":"company","lineage":["https://openalex.org/I1333370159"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruiqi Tian","raw_affiliation_strings":["Motorola Inc., Austin, TX","University of Texas at Austin, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Motorola Inc., Austin, TX","institution_ids":["https://openalex.org/I1333370159"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062524393","display_name":"Hua Xiang","orcid":"https://orcid.org/0000-0003-0369-1225"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hua Xiang","raw_affiliation_strings":["University of Technology, Austin, TX, USA","University of Texas at Austin, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.F. Wong","raw_affiliation_strings":["University of Technology, Austin, TX, USA","University of Texas at Austin, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"56"},"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.9998999834060669,"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.9998999834060669,"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/T10363","display_name":"Low-power high-performance VLSI design","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.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.6667479276657104},{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.6257535219192505},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.529099702835083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48036321997642517},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47575801610946655},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4612921476364136},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4244289994239807},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.42030471563339233},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.33314380049705505},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3304758667945862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23899376392364502},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14533767104148865},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.11695396900177002}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6667479276657104},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.6257535219192505},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.529099702835083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48036321997642517},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47575801610946655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4612921476364136},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4244289994239807},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.42030471563339233},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.33314380049705505},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3304758667945862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23899376392364502},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14533767104148865},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.11695396900177002},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2001.968597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2001.968597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1966211539","https://openalex.org/W2035370690","https://openalex.org/W2042997045","https://openalex.org/W2048312633","https://openalex.org/W2069540823","https://openalex.org/W2087275089","https://openalex.org/W2109138471","https://openalex.org/W2147112599","https://openalex.org/W2154347669","https://openalex.org/W2154363431","https://openalex.org/W2160252016","https://openalex.org/W2162683631","https://openalex.org/W2171982668","https://openalex.org/W2180453974","https://openalex.org/W2319660501","https://openalex.org/W4234887147","https://openalex.org/W4237162529","https://openalex.org/W4239470332","https://openalex.org/W4243318656","https://openalex.org/W6770641979"],"related_works":["https://openalex.org/W2041855631","https://openalex.org/W2105937634","https://openalex.org/W2204238626","https://openalex.org/W2607223747","https://openalex.org/W2081964190","https://openalex.org/W1976978163","https://openalex.org/W2381844443","https://openalex.org/W2555559350","https://openalex.org/W2186630360","https://openalex.org/W2129293467"],"abstract_inverted_index":{"Buffer":[0],"insertion":[1,24,159],"and":[2,25,33,64,73,123,129,150,160,165],"wire":[3,26,66,113],"sizing":[4,27,67,114],"are":[5],"critical":[6],"in":[7,28,104,135],"deep":[8],"submicron":[9],"VLSI":[10],"design.":[11],"This":[12],"paper":[13],"studies":[14],"the":[15,29,54,58,71,86,110,127,138,155,170,174],"problem":[16,87,156],"of":[17,31,60,91,107,137,140,153,157,195],"constructing":[18],"routing":[19,32,61,95,141,189],"trees":[20],"with":[21,57,65],"simultaneous":[22],"buffer":[23,34],"presence":[30],"obstacles.":[35],"No":[36],"previous":[37],"algorithms":[38],"consider":[39],"all":[40],"these":[41],"factors":[42],"simultaneously.":[43],"Previous":[44],"dynamic":[45,148],"programming":[46],"based":[47],"algorithm":[48,144,172,176],"is":[49,82,98,132,151],"first":[50],"extended":[51],"to":[52,84,187],"solve":[53],"problem.":[55],"However,":[56],"size":[59,139],"graph":[62,92],"increasing":[63],"taken":[68],"into":[69],"account,":[70],"time":[72,122,128],"space":[74,124,130],"requirement":[75,131],"increases":[76],"enormously.":[77],"Then":[78],"a":[79,89,105,178,184,192],"new":[80,111],"approach":[81,186],"proposed":[83],"formulate":[85],"as":[88],"series":[90,106],"problems.":[93],"The":[94],"tree":[96,190],"solution":[97],"obtained":[99],"by":[100,177],"finding":[101],"shortest":[102],"paths":[103],"graphs.":[108],"In":[109],"approach,":[112],"can":[115],"be":[116],"handled":[117],"almost":[118],"without":[119],"any":[120],"additional":[121],"requirement,":[125],"Moreover,":[126],"only":[133],"polynomial":[134],"terms":[136],"graph.":[142],"Our":[143],"differs":[145],"from":[146],"traditional":[147],"programming,":[149],"capable":[152],"addressing":[154],"inverter":[158],"sink":[161],"polarity.":[162],"Both":[163],"theoretical":[164],"experimental":[166],"results":[167],"show":[168],"that":[169],"graph-based":[171],"outperforms":[173],"DP-based":[175],"large":[179,193],"margin.":[180],"We":[181],"also":[182],"propose":[183],"hierarchical":[185],"construct":[188],"for":[191],"number":[194],"sinks.":[196]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}