{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T06:10:41Z","timestamp":1744697441194},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00089-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"161-171","source":"Crossref","is-referenced-by-count":19,"title":["Computing optimal rectilinear Steiner trees: A survey and experimental evaluation"],"prefix":"10.1016","volume":"90","author":[{"given":"Joseph L","family":"Ganley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00089-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","article-title":"An SST-based algorithm for the Steiner problem in graphs","volume":"19","author":"Beasley","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB2","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","article-title":"On the average number of maxima in a set of vectors and applications","volume":"25","author":"Bentley","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230200110","article-title":"Faster exact algorithms for Steiner trees in planar networks","volume":"20","author":"Bern","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB4","series-title":"Proc. 2nd Canadian Conference on Computational Geometry","first-page":"315","article-title":"Using partitioning and clustering techniques to generate rectilinear Steiner trees","author":"Deneen","year":"1990"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB5","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/rsa.3240050405","article-title":"A probably fast, provably optimal algorithm for rectilinear Steiner trees","volume":"5","author":"Deneen","year":"1994","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1972","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB7","doi-asserted-by":"crossref","DOI":"10.18130\/V3GW0M","article-title":"Geometric interconnection and placement algorithms","author":"Ganley","year":"1995"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB8","series-title":"Proc. 4th Great Lakes Symposium on VLSI","first-page":"238","article-title":"A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees","author":"Ganley","year":"1994"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB9","series-title":"Proc. 6th Canadian Conference on Computational Geometry","first-page":"308","article-title":"Optimal rectilinear Steiner minimal trees in O(n22.62n) time","author":"Ganley","year":"1994"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218195997000272","article-title":"Improved computation of optimal rectilinear steiner minimal trees","volume":"7","author":"Ganley","year":"1997","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB11","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and its implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","article-title":"On Steiner's problem with rectilinear distance","volume":"14","author":"Hanan","year":"1996","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB14","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB15","article-title":"The Steiner Tree Problem","volume":"Vol. 53","author":"Hwang","year":"1992"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB16","unstructured":"D.M. Inada, private communication, (1995)."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/net.3230150403","article-title":"Probabilistic partitioning algorithms for the rectilinear Steiner problem","volume":"15","author":"Koml\u00f3s","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB18","series-title":"Proc. 2nd Great Lakes Symposium on VLSI","first-page":"207","article-title":"Optimum Steiner tree generation","author":"Lewis","year":"1992"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230180108","article-title":"Convexity and the Steiner tree problem","volume":"18","author":"Provan","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB20","unstructured":"G. Robins, private communication, 1995."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230250206","article-title":"35-point rectilinear Steiner minimal trees in a day","volume":"25","author":"Salowe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230120309","article-title":"An algorithm for the Steiner problem in graphs","volume":"12","author":"Shore","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB23","first-page":"28","article-title":"On minimal rectilinear Steiner trees","volume":"1","author":"Sidorenko","year":"1989","journal-title":"Diskretnaya Matematika"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB24","series-title":"Computational Support for Discrete Mathematics","first-page":"119","article-title":"Rectilinear Steiner tree minimization on a workstation","volume":"Vol. 15","author":"Thomborson","year":"1994"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB25_1","unstructured":"D.M. Warme, A new exact algorithm for rectilinear Steiner trees, Presented at the 1996 INFORMS Conf."},{"key":"10.1016\/S0166-218X(98)00089-4_BIB26","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/net.3230260404","article-title":"Reductions for the rectilinear Steiner tree problem","volume":"26","author":"Winter","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB27","series-title":"Placement and Routing of Electronic Modules","first-page":"261","article-title":"A solution for Steiner's problem","author":"Wong","year":"1993"},{"key":"10.1016\/S0166-218X(98)00089-4_BIB28","series-title":"Proc. Int. Symp. on Circuit Theory","first-page":"154","article-title":"Optimal and suboptimal solution algorithms for the wiring problem","author":"Yang","year":"1972"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000894?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T20:38:45Z","timestamp":1579034325000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98000894"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00089-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}