{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:32:01Z","timestamp":1787340721782,"version":"build-2736575974"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1987,8]]},"abstract":"<jats:p>The problem of connecting a set of n terminals belonging to m (signal) nets that lie on the sides of a rectangle to minimize the total area is discussed. We present an $O(n(m + \\log n))$approximation algorithm to solve this problem. Our algorithm generates a solution with area $ \\leqq 1.6 * {\\operatorname{OPT}}$, where ${\\operatorname{OPT}}$ is the area of an optimal solution. The nets are routed according to the following greedy strategy: the wire connecting all points from a net is one whose path crosses the least number of corners of the rectangle. For some nets there are several routes that cross the least number of corners. A subset of these nets is connected by wires whose paths blend with the paths for other nets. The remaining nets are routed using several strategies and $2^6 $ layouts are obtained. The best of these layouts is the solution generated by our algorithm.<\/jats:p>","DOI":"10.1137\/0216046","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:28:18Z","timestamp":1109226498000},"page":"669-704","source":"Crossref","is-referenced-by-count":9,"title":["A $1.6$ Approximation Algorithm for Routing Multiterminal Nets"],"prefix":"10.1137","volume":"16","author":[{"given":"Teofilo F.","family":"Gonzalez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sing-Ling","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho A.","year":"1975"},{"key":"R2","unstructured":"T. Gonzalez, S. Lee,  An optimal algorithm for optimal routing around a rectangle,  Proc. 20th Annual Allerton Conference on Comm. Control and Computing, Univ. of Illinois, Urbana, IL,  1982,  636\u2013645, October"},{"key":"R3","unstructured":"T. Gonzalez, S. Lee,  An  $O(n \\log n)$ algorithm for optimal routing around a rectangle, Technical Report, #116, Programs in Computer Science, The University of Texas at Dallas, Dallas, TX,  1982, November, (Revised May 1985.)"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.5009431"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675260"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"A. Hashimoto, J. E. Stevens,  Wire routing by optimizing channel assignment without large apertures,  Proc. 8th IEEE Design Automation Conference,  1971,  155\u2013169","DOI":"10.1145\/800158.805069"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"A. S. LaPaugh,  A polynomial time algorithm for optimal routing around a rectangle,  Proc. 21st IEEE Foundations of Computer Science,  1980,  282\u2013293","DOI":"10.1109\/SFCS.1980.7"},{"key":"R8","unstructured":"A. S. LaPaugh, Masters Thesis,  Algorithms for integrated circuit layout, an analytic approach, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA,  1980"},{"key":"R9","volume-title":"Introduction to VLSI Systems","author":"Mead C.","year":"1980"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"R. L. Rivest,  The PI (Placement and Interconnect) System,  Proc. 19th IEEE Design Automation Conference,  475\u2013481","DOI":"10.1109\/DAC.1982.1585541"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"S. Sahni, A. Bhatt, R. Raghavan,  The complexity of design automation problems,  Proc. 17th Design Automation Conference,  1980,  402\u2013411, June","DOI":"10.1145\/800139.804562"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0216046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:45:31Z","timestamp":1787337931000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0216046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["10.1137\/0216046"],"URL":"https:\/\/doi.org\/10.1137\/0216046","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}