{"id":"https://openalex.org/W2058836520","doi":"https://doi.org/10.1137/0216046","title":"A $1.6$ Approximation Algorithm for Routing Multiterminal Nets","display_name":"A $1.6$ Approximation Algorithm for Routing Multiterminal Nets","publication_year":1987,"publication_date":"1987-08-01","ids":{"openalex":"https://openalex.org/W2058836520","doi":"https://doi.org/10.1137/0216046","mag":"2058836520"},"language":"en","primary_location":{"id":"doi:10.1137/0216046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216046","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/A5075781836","display_name":"Teofilo F. Gonzalez","orcid":"https://orcid.org/0009-0009-8211-4135"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Teofilo F. Gonzalez","raw_affiliation_strings":["University of California,Santa Barbara,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Santa Barbara,","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086479611","display_name":"SingLing Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sing-Ling Lee","raw_affiliation_strings":["Pennsylvania State University, University Park#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park#TAB#","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.26814346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"669","last_page":"704"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9904000163078308,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/rectangle","display_name":"Rectangle","score":0.9018734693527222},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.6771121621131897},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6496829986572266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6328334212303162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6313916444778442},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5913702249526978},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5825715065002441},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5608014464378357},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5370786190032959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5091354250907898},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4131265878677368},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3691629469394684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26308345794677734},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1729952096939087}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.9018734693527222},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.6771121621131897},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6496829986572266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6328334212303162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6313916444778442},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5913702249526978},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5825715065002441},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5608014464378357},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5370786190032959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5091354250907898},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4131265878677368},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3691629469394684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26308345794677734},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1729952096939087},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0216046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216046","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1761548667","https://openalex.org/W1967575124","https://openalex.org/W2165467657"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W2109089820","https://openalex.org/W2171912994","https://openalex.org/W2058836520","https://openalex.org/W2804502399","https://openalex.org/W3191464501","https://openalex.org/W2165467657","https://openalex.org/W2119274774","https://openalex.org/W3145512143","https://openalex.org/W2020058388"],"abstract_inverted_index":{"The":[0,62,125,139],"problem":[1],"of":[2,6,19,58,88,90,105,109,141],"connecting":[3,74],"a":[4,20,44,78],"set":[5],"n":[7],"terminals":[8],"belonging":[9],"to":[10,22,37,67],"m":[11],"(signal)":[12],"nets":[13,63,95,111,127],"that":[14,100],"lie":[15],"on":[16],"the":[17,24,56,68,72,85,91,102,120,145],"sides":[18],"rectangle":[21],"minimize":[23],"total":[25],"area":[26,47,57],"is":[27,55,80,112,144],"discussed.":[28],"We":[29],"present":[30],"an":[31,59],"$O(n(m":[32],"+":[33],"\\log":[34],"n))$approximation":[35],"algorithm":[36,42],"solve":[38],"this":[39],"problem.":[40],"Our":[41],"generates":[43],"solution":[45,146],"with":[46,119],"$":[48,135],"\\leqq":[49],"1.6":[50],"*":[51],"{\\operatorname{OPT}}$,":[52],"where":[53],"${\\operatorname{OPT}}$":[54],"optimal":[60],"solution.":[61],"are":[64,97,128,137],"routed":[65,129],"according":[66],"following":[69],"greedy":[70],"strategy:":[71],"wire":[73],"all":[75],"points":[76],"from":[77],"net":[79],"one":[81],"whose":[82,116],"path":[83],"crosses":[84],"least":[86,103],"number":[87,104],"corners":[89],"rectangle.":[92],"For":[93],"some":[94],"there":[96],"several":[98,131],"routes":[99],"cross":[101],"corners.":[106],"A":[107],"subset":[108],"these":[110,142],"connected":[113],"by":[114,148],"wires":[115],"paths":[117,121],"blend":[118],"for":[122],"other":[123],"nets.":[124],"remaining":[126],"using":[130],"strategies":[132],"and":[133],"$2^6":[134],"layouts":[136,143],"obtained.":[138],"best":[140],"generated":[147],"our":[149],"algorithm.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}