{"id":"https://openalex.org/W2157330053","doi":"https://doi.org/10.1142/s0218195993000178","title":"OPTIMAL ROUTING THROUGH DENSE CHANNELS","display_name":"OPTIMAL ROUTING THROUGH DENSE CHANNELS","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W2157330053","doi":"https://doi.org/10.1142/s0218195993000178","mag":"2157330053"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195993000178","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000178","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"DOROTHEA WAGNER","raw_affiliation_strings":["Fachbereich Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045460793"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":2.155,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87320022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"03","issue":"03","first_page":"269","last_page":"289"},"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.9927999973297119,"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.9927999973297119,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/mathematics","display_name":"Mathematics","score":0.6563048958778381},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5755607485771179},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5346243977546692},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4671119451522827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4426722526550293},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4228478968143463},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40009772777557373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2410532832145691}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6563048958778381},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5755607485771179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5346243977546692},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4671119451522827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4426722526550293},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4228478968143463},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40009772777557373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2410532832145691},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195993000178","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000178","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W1991411408","https://openalex.org/W2066456778","https://openalex.org/W1534342405"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"new":[3],"channel":[4],"routing":[5],"algorithm":[6,59,90],"in":[7,60,74,136],"the":[8,33,46,58,80,89,102,112,130],"knock-knee":[9],"mode":[10],"that":[11],"produces":[12],"for":[13],"dense":[14],"problems":[15],"area-optimal":[16,67],"layouts":[17,68],"with":[18,69],"minimum":[19,70],"total":[20,34,71,103],"wire":[21,72,104],"length":[22,73,105],"and":[23],"[Formula:":[24,52,75],"see":[25,53,76],"text]":[26,77],"bends":[27,37,83],"(n":[28],"number":[29,35,81],"of":[30,36,82,132],"nets),":[31],"where":[32,79,101],"is":[38,51,84,106,118,127],"at":[39,107],"most":[40,108],"d\u22122":[41],"(d":[42],"density)":[43],"more":[44,110],"than":[45,111],"minimum.":[47,113],"The":[48,114],"running":[49],"time":[50],"text].":[54],"It":[55,126],"thus":[56],"improves":[57],"Formann":[61],"et":[62],"al.,":[63],"3":[64],"which":[65],"determines":[66],"time,":[78],"\u03a9(n":[85],"2":[86],").":[87],"Moreover,":[88],"can":[91],"be":[92],"modified":[93],"so":[94],"as":[95],"to":[96],"guarantee":[97],"three-layer":[98],"wirable":[99],"layouts,":[100],"n\u22122":[109],"approach":[115],"we":[116],"use":[117],"completely":[119],"different":[120],"from":[121],"all":[122],"previously":[123],"known":[124],"algorithms.":[125],"based":[128],"on":[129],"notion":[131],"cycle":[133],"graphs":[134],"introduced":[135],"this":[137],"paper.":[138]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}