{"id":"https://openalex.org/W4386764800","doi":"https://doi.org/10.1109/dac56929.2023.10247969","title":"Pathfinding Model and Lagrangian-Based Global Routing","display_name":"Pathfinding Model and Lagrangian-Based Global Routing","publication_year":2023,"publication_date":"2023-07-09","ids":{"openalex":"https://openalex.org/W4386764800","doi":"https://doi.org/10.1109/dac56929.2023.10247969"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac56929.2023.10247969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5114082631","display_name":"Pengju Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pengju Yao","raw_affiliation_strings":["Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116"],"affiliations":[{"raw_affiliation_string":"Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100405815","display_name":"Ping Zhang","orcid":"https://orcid.org/0000-0002-6123-7488"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ping Zhang","raw_affiliation_strings":["Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116"],"affiliations":[{"raw_affiliation_string":"Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116","institution_ids":["https://openalex.org/I80947539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100413098","display_name":"Wenxing Zhu","orcid":"https://orcid.org/0000-0002-8698-0024"},"institutions":[{"id":"https://openalex.org/I80947539","display_name":"Fuzhou University","ror":"https://ror.org/011xvna82","country_code":"CN","type":"education","lineage":["https://openalex.org/I80947539"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenxing Zhu","raw_affiliation_strings":["Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116"],"affiliations":[{"raw_affiliation_string":"Fuzhou University,Center for Discrete Mathematics and Theoretical Computer Science,Fuzhou,China,350116","institution_ids":["https://openalex.org/I80947539"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.519,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.547354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":78,"max":84},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9999,"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.9999,"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.9993,"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/T11338","display_name":"Advancements in Photolithography Techniques","score":0.9972,"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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.72228014},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.55152136}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7408222},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.72228014},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.6773594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.66151106},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6505965},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.55152136},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5080545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49691966},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.46619883},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46550184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3699186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21460187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14493644},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.13737571},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.09944534},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac56929.2023.10247969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China","award_id":null}],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2013557211","https://openalex.org/W2053902150","https://openalex.org/W2071682149","https://openalex.org/W2108913694","https://openalex.org/W2125831674","https://openalex.org/W2171122650","https://openalex.org/W2997936488","https://openalex.org/W2998517322","https://openalex.org/W3092633010","https://openalex.org/W3145770066","https://openalex.org/W3148937850","https://openalex.org/W4213332166","https://openalex.org/W4235935333","https://openalex.org/W4247156909","https://openalex.org/W4247848135","https://openalex.org/W4249660316","https://openalex.org/W4254855014"],"related_works":["https://openalex.org/W98480971","https://openalex.org/W4289994039","https://openalex.org/W4285687848","https://openalex.org/W2164382479","https://openalex.org/W2157978810","https://openalex.org/W2150291671","https://openalex.org/W2146343568","https://openalex.org/W2058965144","https://openalex.org/W2027972911","https://openalex.org/W2013643406"],"abstract_inverted_index":{"Global":[0],"routing":[1,48,70,95],"is":[2,36,51,138,161],"a":[3,13,32,45,55],"critical":[4],"step":[5],"in":[6,102,129],"VLSI":[7,23],"physical":[8],"design.":[9],"This":[10],"paper":[11],"proposes":[12],"novel":[14],"pathfinding":[15],"model":[16,42],"based":[17],"on":[18,112,151],"integer":[19],"linear":[20],"programming":[21],"for":[22],"global":[24,90,94],"routing.":[25],"The":[26],"Lagrangian":[27],"relaxation":[28],"method":[29],"combined":[30],"with":[31],"direction-aware":[33],"weighted":[34],"A*-algorithm":[35],"developed":[37],"to":[38,43,77,121,142],"quickly":[39],"solve":[40],"the":[41,79,104,108,113,117,130,135,152,157],"obtain":[44],"better":[46],"initial":[47],"solution,":[49],"which":[50],"further":[52],"optimized":[53],"by":[54],"designed":[56],"multi-stage":[57],"rip-up":[58,66],"&":[59,67,100],"rerouting":[60],"algorithm.":[61],"In":[62],"each":[63],"stage":[64],"of":[65,110,132,159],"rerouting,":[68],"different":[69],"algorithms":[71],"and":[72,81,85,107,134,156],"cost":[73],"functions":[74],"are":[75,87],"used":[76],"optimize":[78],"overflow":[80],"wire":[82,105,154],"length.":[83],"SPRoute":[84,98,143],"CUGR":[86],"two":[88],"state-of-the-art":[89],"routers.":[91],"Our":[92],"proposed":[93],"algorithm":[96,124,146],"outperforms":[97],"1.0":[99],"2.0":[101],"both":[103],"length":[106],"number":[109,131,158],"vias":[111,160],"ISPD08":[114],"benchmarks.":[115],"On":[116],"ISPD18":[118],"benchmarks,":[119],"compared":[120,141],"CUGR,":[122],"our":[123,145],"has":[125,147],"about":[126,148],"5.1%":[127],"reduction":[128,150],"vias,":[133],"average":[136,153],"runtime":[137],"4.89\u00d7":[139],"speedup;":[140],"2.0,":[144],"1.7%":[149],"length,":[155],"comparable.":[162]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4386764800","counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-01-01T23:23:24.526892","created_date":"2023-09-16"}