{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:04:15Z","timestamp":1775066655866,"version":"3.50.1"},"reference-count":13,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10816,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A minimal rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees have potential application to wire layout for printed circuits. Unfortunately, at present no practical algorithm is known for constructing these trees in general. We present two algorithms, each requiring a number of operations proportional to only a low degree polynomial in the number of points to be interconnected, for the special cases in which all the points of A lie on a small number of parallel lines or on the boundary of a rectangle.<\/jats:p>","DOI":"10.1002\/net.3230070104","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T03:24:26Z","timestamp":1178853866000},"page":"37-58","source":"Crossref","is-referenced-by-count":84,"title":["Rectilinear steiner trees: Efficient special\u2010case algorithms"],"prefix":"10.1002","volume":"7","author":[{"given":"A. V.","family":"Aho","sequence":"first","affiliation":[]},{"given":"M. R.","family":"Garey","sequence":"additional","affiliation":[]},{"given":"F. K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321733"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"Cook S. A. \u201cThe Complexity of Theorem Proving Procedures \u201dProc. 3rd Annual ACM Symposium on Theory of Computing 1971 pp.151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_2_1_5_2","unstructured":"Fu Y. \u201cApplications of Linear Graph Theory to Printed Circuits \u201dProc. First Asilomar Conference on Systems and Circuits 1967 pp.721\u2013729."},{"key":"e_1_2_1_6_2","article-title":"The Rectilinear Steiner Tree Problem is NP\u2010Complete","author":"Garey M. R.","journal-title":"SIAM J. Appl. Math."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010203"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1972.1083408"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0130013"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_13_2","unstructured":"Yang Y. Y.andO.Wing \u201cAn Algorithm for the Wiring Problem \u201dDigest of IEEE International Symposium on Electrical Networks 1971."},{"key":"e_1_2_1_14_2","unstructured":"Yang Y. Y.andO.Wing \u201cOptimal and Suboptimal Solution Algorithms for the Wiring Problem \u201dProa. IEEE International Symposium on Circuit Theory 1972 pp.154\u2013158."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:32:08Z","timestamp":1699785128000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/net.3230070104"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070104","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}