{"id":"https://openalex.org/W2051584339","doi":"https://doi.org/10.1137/0215012","title":"A Provably Good Algorithm for the Two Module Routing Problem","display_name":"A Provably Good Algorithm for the Two Module Routing Problem","publication_year":1986,"publication_date":"1986-02-01","ids":{"openalex":"https://openalex.org/W2051584339","doi":"https://doi.org/10.1137/0215012","mag":"2051584339"},"language":"en","primary_location":{"id":"doi:10.1137/0215012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215012","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5108392571","display_name":"Brenda S. Baker","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brenda S. Baker","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108392571"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0844,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77327665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"1","first_page":"162","last_page":"188"},"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.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"}},{"id":"https://openalex.org/T10460","display_name":"Electronic Packaging and Soldering Technologies","score":0.9973999857902527,"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/routing","display_name":"Routing (electronic design automation)","score":0.7313085794448853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5581101179122925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5523567199707031},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5426486134529114},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5124988555908203},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.49546706676483154},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4758572280406952},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4601941406726837},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.45154285430908203},{"id":"https://openalex.org/keywords/placement","display_name":"Placement","score":0.4421462416648865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4001302421092987},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3342362344264984},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20932841300964355},{"id":"https://openalex.org/keywords/physical-design","display_name":"Physical design","score":0.18531575798988342},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13592594861984253},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06363603472709656}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7313085794448853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5581101179122925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5523567199707031},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5426486134529114},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5124988555908203},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.49546706676483154},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4758572280406952},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4601941406726837},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.45154285430908203},{"id":"https://openalex.org/C117690923","wikidata":"https://www.wikidata.org/wiki/Q1484784","display_name":"Placement","level":4,"score":0.4421462416648865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4001302421092987},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3342362344264984},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20932841300964355},{"id":"https://openalex.org/C188817802","wikidata":"https://www.wikidata.org/wiki/Q13426855","display_name":"Physical design","level":3,"score":0.18531575798988342},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13592594861984253},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06363603472709656},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215012","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1539256413","https://openalex.org/W1565475869","https://openalex.org/W1602918477","https://openalex.org/W1603796055","https://openalex.org/W1973310391"],"related_works":["https://openalex.org/W2347665962","https://openalex.org/W2351097701","https://openalex.org/W2555559350","https://openalex.org/W2162880363","https://openalex.org/W1996079847","https://openalex.org/W2317653264","https://openalex.org/W2154440508","https://openalex.org/W1978148660","https://openalex.org/W2362764218","https://openalex.org/W1991690148"],"abstract_inverted_index":{"In":[0],"the":[1,35,48,61,71,80,92,103,120,141,146,149,153,185,191,203,223,243],"Mead\u2013Conway":[2],"design":[3,30],"methodology":[4],"for":[5,135,209],"LSI,":[6],"modules":[7,18,69],"are":[8,82],"designed":[9],"and":[10,38,117],"then":[11],"connected":[12],"by":[13,126,239],"wires":[14,110,118],"to":[15,27,102,198,218],"form":[16],"larger":[17],"in":[19,57,107,178,194,235,245],"a":[20,29,114,200],"hierarchical":[21],"fashion.":[22],"It":[23],"would":[24,33],"be":[25,39,99,124,216,233],"helpful":[26],"have":[28],"aid":[31],"that":[32,79,170],"do":[34],"routing":[36,64,134,155,195,201,205],"automatically":[37],"guaranteed":[40],"of":[41,47,50,63,70,91,94,143,148,171,187,190,225],"coming":[42],"within":[43],"some":[44],"fixed":[45],"percentage":[46],"size":[49,224],"an":[51,132,159,172,226],"optimal":[52,133,173,204,227],"routing.":[53,174,228],"With":[54],"this":[55,136,246],"goal":[56],"mind,":[58],"we":[59],"investigate":[60],"problem":[62,137],"two-terminal":[65],"nets":[66],"between":[67],"two":[68],"same":[72,121],"width":[73],"but":[74],"possibly":[75],"different":[76],"heights,":[77],"assuming":[78],"sides":[81,93],"aligned":[83],"vertically.":[84],"The":[85,175,211],"terminals":[86],"may":[87,232],"lie":[88,112],"on":[89,113,222],"any":[90],"either":[95],"module.":[96],"Wires":[97],"must":[98,111,123],"routed":[100],"according":[101],"\u201cManhattan\u201d":[104],"reserved-layer":[105],"model,":[106],"which":[108],"all":[109],"rectilinear":[115],"grid,":[116],"running":[119],"direction":[122],"separated":[125],"at":[127,166],"least":[128],"unit":[129],"distance.":[130],"Finding":[131],"is":[138,145,164,184,196,206],"NP-hard,":[139],"where":[140,182],"measure":[142],"performance":[144,163],"perimeter":[147],"bounding":[150],"box":[151],"around":[152],"whole":[154],"region.":[156],"We":[157],"describe":[158],"algorithm":[160,176,244],"whose":[161],"worst-case":[162],"asymptotically":[165],"most":[167],"19/10":[168],"times":[169],"runs":[177],"$O(n\\log":[179],"n)$":[180],"time,":[181],"n":[183],"number":[186],"nets.":[188],"One":[189],"problems":[192],"encountered":[193],"how":[197],"evaluate":[199],"when":[202],"not":[207],"available":[208],"comparison.":[210],"techniques":[212,231],"given":[213],"here":[214],"can":[215],"used":[217],"calculate":[219],"lower":[220],"bounds":[221],"Thus,":[229],"these":[230],"useful":[234],"evaluating":[236],"routings":[237],"produced":[238],"methods":[240],"other":[241],"than":[242],"paper.":[247]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}