{"id":"https://openalex.org/W2140800546","doi":"https://doi.org/10.1109/tcad.2009.2013274","title":"Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits","display_name":"Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits","publication_year":2009,"publication_date":"2009-02-19","ids":{"openalex":"https://openalex.org/W2140800546","doi":"https://doi.org/10.1109/tcad.2009.2013274","mag":"2140800546"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2009.2013274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2009.2013274","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-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/A5103071783","display_name":"Muhammet Mustafa \u00d6zdal","orcid":"https://orcid.org/0000-0002-6239-9622"},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M.M. Ozdal","raw_affiliation_strings":["Strategic CAD Laboratories, Intel Corporation, Hillsboro, OR, USA","Strategic CAD Laboratories, Intel Corporation, Hillsboro, OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Strategic CAD Laboratories, Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]},{"raw_affiliation_string":"Strategic CAD Laboratories, Intel Corporation, Hillsboro, OR","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103071783"],"corresponding_institution_ids":["https://openalex.org/I1343180700"],"apc_list":null,"apc_paid":null,"fwci":1.5013,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.84197982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"28","issue":"3","first_page":"340","last_page":"349"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9976000189781189,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.8044368624687195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6529693603515625},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5958322286605835},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5853983759880066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5533416867256165},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5011274814605713},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4959946572780609},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48609280586242676},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4668441712856293},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43916943669319153},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.42339587211608887},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41134411096572876},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3875182867050171},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3843539357185364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24598070979118347},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2120455503463745},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10998797416687012}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.8044368624687195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6529693603515625},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5958322286605835},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5853983759880066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5533416867256165},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5011274814605713},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4959946572780609},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48609280586242676},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4668441712856293},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43916943669319153},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42339587211608887},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41134411096572876},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3875182867050171},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3843539357185364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24598070979118347},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2120455503463745},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10998797416687012},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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":[{"id":"doi:10.1109/tcad.2009.2013274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2009.2013274","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1975577567","https://openalex.org/W2001912652","https://openalex.org/W2017697298","https://openalex.org/W2054938277","https://openalex.org/W2090220859","https://openalex.org/W2097774291","https://openalex.org/W2114532661","https://openalex.org/W2122851474","https://openalex.org/W2128161498","https://openalex.org/W2129736362","https://openalex.org/W2133435384","https://openalex.org/W2137890965","https://openalex.org/W2142350374","https://openalex.org/W2148774992","https://openalex.org/W2153580689","https://openalex.org/W2160474882","https://openalex.org/W2161474076","https://openalex.org/W2163929525","https://openalex.org/W2164262479","https://openalex.org/W2165465743","https://openalex.org/W2752885492","https://openalex.org/W3123221209","https://openalex.org/W3142387955","https://openalex.org/W3145128584","https://openalex.org/W3145225676","https://openalex.org/W3145853217","https://openalex.org/W3146788732","https://openalex.org/W4243621528","https://openalex.org/W4246322628","https://openalex.org/W4255261856","https://openalex.org/W4255326129","https://openalex.org/W6678300669","https://openalex.org/W6679151251","https://openalex.org/W6679928151","https://openalex.org/W6837309793"],"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":{"As":[0],"design":[1],"complexities":[2],"and":[3,16,46,110,148,189],"circuit":[4],"densities":[5],"are":[6,100],"increasing,":[7],"the":[8,22,34,87,97,112,134,143,146,166,176,182],"detailed-routing":[9],"(DR)":[10],"problem":[11,114],"is":[12,29,140,154],"becoming":[13],"a":[14,68,80,92,108,123,130,161],"more":[15,17],"challenging":[18],"problem.":[19,136,168],"Due":[20],"to":[21,32,48,85,164],"high":[23],"complexity":[24],"of":[25,67,70,94,184],"DR":[26],"algorithms,":[27],"it":[28],"very":[30],"important":[31],"start":[33],"routing":[35,66],"process":[36],"with":[37,43,115,133],"clean":[38],"solutions":[39],"rather":[40],"than":[41],"starting":[42],"suboptimal":[44],"routes":[45],"trying":[47],"fix":[49],"them":[50],"in":[51,142],"an":[52,60],"iterative":[53],"process.":[54],"In":[55],"this":[56,105,157,173],"paper,":[57],"we":[58,77,103,121,159],"propose":[59,79,122,160],"escape-routing":[61,89,135],"algorithm":[62,82,106,163,174],"that":[63,83,128,145,172,186],"can":[64],"optimize":[65],"set":[69,93],"nets":[71,95,185],"around":[72],"their":[73],"terminals.":[74],"For":[75,119],"this,":[76,120],"first":[78],"polynomial-time":[81],"guarantees":[84],"find":[86],"optimal":[88],"solution":[90],"for":[91],"when":[96],"track":[98,117],"structures":[99],"uniform.":[101],"Then,":[102],"use":[104],"as":[107],"baseline":[109],"study":[111],"general":[113],"arbitrary":[116],"structures.":[118],"novel":[124,141],"multicommodity-flow":[125],"(MCF)":[126],"model":[127,139],"has":[129],"one-to-one":[131],"correspondence":[132],"This":[137],"MCF":[138],"sense":[144],"interdependence":[147],"contention":[149],"between":[150],"different":[151],"flow":[152],"commodities":[153],"minimal.":[155],"Using":[156],"model,":[158],"Lagrangian-relaxation-based":[162],"solve":[165],"escape":[167],"Our":[169],"experiments":[170],"demonstrate":[171],"improves":[175],"overall":[177],"routability":[178],"significantly":[179],"by":[180],"reducing":[181],"number":[183],"require":[187],"rip-up":[188],"reroute.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}