{"id":"https://openalex.org/W4414198701","doi":"https://doi.org/10.1109/dac63849.2025.11133098","title":"PatLabor: Pareto Optimization of Timing-Driven Routing Trees","display_name":"PatLabor: Pareto Optimization of Timing-Driven Routing Trees","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4414198701","doi":"https://doi.org/10.1109/dac63849.2025.11133098"},"language":"en","primary_location":{"id":"doi:10.1109/dac63849.2025.11133098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","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/A5100324483","display_name":"Ziyang Chen","orcid":"https://orcid.org/0000-0002-2467-8372"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhiyang Chen","raw_affiliation_strings":["Tsinghua University"],"affiliations":[{"raw_affiliation_string":"Tsinghua University","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058812423","display_name":"Hailong Yao","orcid":"https://orcid.org/0000-0002-8750-3086"},"institutions":[{"id":"https://openalex.org/I92403157","display_name":"University of Science and Technology Beijing","ror":"https://ror.org/02egmk993","country_code":"CN","type":"education","lineage":["https://openalex.org/I92403157"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hailong Yao","raw_affiliation_strings":["University of Science and Technology Beijing"],"affiliations":[{"raw_affiliation_string":"University of Science and Technology Beijing","institution_ids":["https://openalex.org/I92403157"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100301881","display_name":"Xia Yin","orcid":"https://orcid.org/0000-0001-9152-9329"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xia Yin","raw_affiliation_strings":["Tsinghua University"],"affiliations":[{"raw_affiliation_string":"Tsinghua University","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100324483"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27720327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"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.998199999332428,"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.9977999925613403,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9929999709129333,"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/pareto-principle","display_name":"Pareto principle","score":0.6747999787330627},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6579999923706055},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6079000234603882},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5911999940872192},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.44859999418258667},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.39079999923706055},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.34360000491142273}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6747999787330627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6715999841690063},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6579999923706055},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6079000234603882},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5911999940872192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181000232696533},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.44859999418258667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4034000039100647},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.39079999923706055},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.34360000491142273},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.335999995470047},{"id":"https://openalex.org/C38814450","wikidata":"https://www.wikidata.org/wiki/Q7136870","display_name":"Pareto interpolation","level":4,"score":0.32010000944137573},{"id":"https://openalex.org/C118127601","wikidata":"https://www.wikidata.org/wiki/Q3797610","display_name":"Pareto analysis","level":3,"score":0.3151000142097473},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dac63849.2025.11133098","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1981463101","https://openalex.org/W1982562599","https://openalex.org/W1988808425","https://openalex.org/W1996668544","https://openalex.org/W2020112047","https://openalex.org/W2025299767","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2070582626","https://openalex.org/W2082635360","https://openalex.org/W2112948982","https://openalex.org/W2125831674","https://openalex.org/W2140055763","https://openalex.org/W2144677702","https://openalex.org/W2150488380","https://openalex.org/W2165142526","https://openalex.org/W2296073425","https://openalex.org/W2343109328","https://openalex.org/W2625599877","https://openalex.org/W2790830285","https://openalex.org/W2914161519","https://openalex.org/W2914414140","https://openalex.org/W2951475756","https://openalex.org/W3128852614","https://openalex.org/W3211880575","https://openalex.org/W4389160770","https://openalex.org/W4404132991"],"related_works":[],"abstract_inverted_index":{"Wirelength":[0],"is":[1,26,109],"the":[2,9,60,79],"fundamental":[3],"metric":[4],"for":[5,22,73,152],"VLSI":[6],"routing.":[7,75],"With":[8],"advancement":[10],"of":[11],"new":[12],"technologies,":[13],"wire":[14],"delay":[15,34,52],"has":[16],"also":[17],"become":[18],"a":[19,54,70],"significant":[20],"factor":[21],"timing":[23],"performances.":[24],"It":[25],"thus":[27],"necessary":[28],"to":[29,48,105,144],"consider":[30],"both":[31],"wirelength":[32,50],"and":[33,51,90,108,116,125],"in":[35],"routing":[36,41],"tree":[37],"construction,":[38],"i.e.,":[39],"timing-driven":[40,74],"trees.":[42],"Prior":[43],"methods":[44,89,135,151],"propose":[45,68],"various":[46],"heuristics":[47],"balance":[49],"with":[53],"tunable":[55],"parameter,":[56],"which":[57,82],"cannot":[58],"compute":[59],"full":[61],"Pareto":[62,80,85,131],"frontier.":[63],"In":[64],"this":[65],"work,":[66],"we":[67],"PatLabor,":[69],"practical":[71],"method":[72],"PatLabor":[76,96,128,141],"directly":[77],"optimizes":[78],"set,":[81],"obtains":[83,97,129,142],"tighter":[84,130],"curves":[86,132],"than":[87,133,149],"prior":[88,150],"does":[91],"not":[92],"require":[93],"parameter":[94],"tuning.":[95],"all":[98],"Paretooptimal":[99],"solutions":[100,148],"on":[101,136],"small-degree":[102],"nets":[103],"up":[104,143],"9":[106],"pins":[107],"theoretically":[110],"guaranteed":[111],"by":[112],"provable":[113],"time":[114],"complexity":[115],"approximation":[117],"bounds.":[118],"Experimental":[119],"results":[120],"verify":[121],"our":[122],"theoretical":[123],"findings":[124],"show":[126],"that":[127],"state-of-the-art":[134],"ICCAD-15":[137],"benchmarks.":[138],"For":[139],"example,":[140],"58.5%":[145],"more":[146],"Pareto-optimal":[147],"degree-9":[153],"nets.":[154]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}