{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:49Z","timestamp":1725467809668},"publisher-location":"New York, NY","reference-count":21,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387976280"},{"type":"electronic","value":"9780387348155"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0038511","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:59:13Z","timestamp":1153994353000},"page":"329-335","source":"Crossref","is-referenced-by-count":0,"title":["Correct and provably efficient methods for rectilinear Steiner spanning tree generation"],"prefix":"10.1007","author":[{"given":"F. D.","family":"Lewis","sequence":"first","affiliation":[]},{"given":"N.","family":"Van Cleave","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"47_CR1","unstructured":"Bern, M. W., and M. de Carvalho. \u201cA Greedy Hueristic for the Rectilinear Steiner Tree Problem.\u201d Univ. California at Berkeley TR, (1985)."},{"key":"47_CR2","first-page":"855","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"Garey, M. R., and D. S. Johnson. \u201cThe Rectilinear Steiner Tree Problem is NP-Complete.\u201d SIAM J of Applied Mathematics, 32 (1977), 855\u2013859.","journal-title":"SIAM J of Applied Mathematics"},{"issue":"2","key":"47_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M. \u201cOn Steiners Problem with Rectilinear Distance.\u201d SIAM Journal of Applied Mathematics, 14:2 (1966), 255\u2013265.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Ho, J., G. Vijayan, and C. K. Wong. \u201cA New Approach to the Steiner Tree Problem.\u201d Proc. 26th ACM\/IEEE Design Auto. Conf. (1989), 161\u2013166.","DOI":"10.1145\/74382.74410"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1137\/0130013","volume":"30","author":"F. K. Hwang","year":"1976","unstructured":"Hwang, F. K. \u201cOn Steiner Minimal Trees with Rectilinear Distance.\u201d SIAM Journal of Applied Mathematics, 30 (1976), 104\u2013114.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"1","key":"47_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TCS.1979.1084551","volume":"CAS-26","author":"F. K. Hwang","year":"1979","unstructured":"Hwang, F. K. \u201cAn O(nlogn) Algorithm for Sub-optimal Rectilinear Steiner Trees.\u201d IEEE Trans. on Circuits and Systems CAS-26:1 (1979), 75\u201377.","journal-title":"IEEE Trans. on Circuits and Systems"},{"issue":"2","key":"47_CR7","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H. Imai","year":"1986","unstructured":"Imai, H., and T. Asano. \u201cEfficient Algorithms for Geometric Graph Search Problems.\u201d SIAM Journal of Computing, 15:2 (1986), 478\u2013494.","journal-title":"SIAM Journal of Computing"},{"key":"47_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/net.3230150403","volume":"15","author":"J. Komlos","year":"1985","unstructured":"Komlos, J., and M. T. Shing. \u201cProbabilistic Partitioning Algorithms for the Rectilinear Steiner Problem.\u201d Network, 15 (1985), 413\u2013423.","journal-title":"Network"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"Kruskal, J. B. \u201cOn the Shortest Spanning Subtree of a Graph.\u201d Proceedings of the American Mathematical Society, 7 (1956) 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"47_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/net.3230110307","volume":"11","author":"R. C. Larson","year":"1981","unstructured":"Larson, R. C., and V. O. Li. \u201cFinding Minimum Rectilinear Distance Paths in the Presence of Barriers.\u201d Networks, 11 (1981), 285\u2013304.","journal-title":"Networks"},{"issue":"7","key":"47_CR11","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/TCS.1976.1084243","volume":"CAS-23","author":"J. H. Lee","year":"1976","unstructured":"Lee, J. H., N. K. Bose, and F. K. Hwang. \u201cUse of Steiner's Problem in Suboptimal Routing in Rectilinear Metric.\u201d IEEE Trans. on Circuits and Systems, CAS-23:7 (July 1976), 470\u2013476.","journal-title":"IEEE Trans. on Circuits and Systems"},{"issue":"4","key":"47_CR12","first-page":"298","volume":"CAD-3","author":"J. T. Li","year":"1984","unstructured":"Li, J. T., and M. Marek-Sadowska. \u201cGlobal Routing for Gate Arrays.\u201d IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, CAD-3:4 (Oct 1984), 298\u2013308.","journal-title":"IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems"},{"key":"47_CR13","unstructured":"Ng, A. P-C, P. Raghavan, and C. D. Thompson. \u201cExperimental Results for a Linear Program Global Router.\u201d manuscript submitted to: Computers and AI and 1986 ACM Design Automation Conference, (November 1985)."},{"key":"47_CR14","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"Prim, R. C. \u201cShortest Connection Networks and Some Generalizations.\u201d Bell System Tech. J. 36 (1957), 1389\u20131401.","journal-title":"Bell System Tech. J."},{"key":"47_CR15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"V.J. Rayward-Smith","year":"1983","unstructured":"Rayward-Smith, V.J. \u201cThe Computation of Nearly Minimal Steiner Trees in Graphs.\u201d Int. J. of Math. Education in Sci. and Tech. 14 (1983), 15\u201323.","journal-title":"Int. J. of Math. Education in Sci. and Tech."},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01553886","volume":"4","author":"D. Richards","year":"1989","unstructured":"Richards, D. \u201cFast Heuristic Algorithms for Rectilinear Steiner Trees.\u201d Algorithmica 4 (1989), 191\u2013207.","journal-title":"Algorithmica"},{"key":"47_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/03052158008902421","volume":"4","author":"J. M. Smith","year":"1980","unstructured":"Smith, J. M., D. T. Lee, and J. S. Liebman. \u201cAn O(nlogn) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem.\u201d Eng. Optimization 4 (1980), 179\u2013192.","journal-title":"Eng. Optimization"},{"key":"47_CR18","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H. and A Matsuyama. \u201cAn Approximate Solution for the Steiner Problem in Graphs.\u201d Mathematica Japonica 24 (1980), 573\u2013577.","journal-title":"Mathematica Japonica"},{"key":"47_CR19","volume-title":"Rectilinear Steiner Tree Algorithms for the Global Routing Phase of VLSI Design","author":"N. Cleave Van","year":"1987","unstructured":"Van Cleave, N. \u201cRectilinear Steiner Tree Algorithms for the Global Routing Phase of VLSI Design.\u201d M.S. Thesis, University of Kentucky, Lexington, KY (1987)."},{"issue":"4","key":"47_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/TCAD.1983.1270039","volume":"CAD-2","author":"M. Vecchi","year":"1983","unstructured":"Vecchi, M., and S. Kirkpatrick. \u201cGlobal Wiring by Simulated Annealing.\u201d IEEE Trans. on Computer-Aided Design,\u201d CAD-2:4 (Oct 1983), 215\u2013222.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"47_CR21","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P. \u201cSteiner Problem in Networks: A Survey.\u201d Networks, 17 (1987), 128\u2013167.","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computing in the 90's"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:40:53Z","timestamp":1555749653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780387976280","9780387348155"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0038511","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}