{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635843},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0166-218x(99)00222-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:56:52Z","timestamp":1027591012000},"page":"141-152","source":"Crossref","is-referenced-by-count":1,"title":["On shortest three-edge-connected Steiner networks with Euclidean distance"],"prefix":"10.1016","volume":"103","author":[{"given":"D.Frank","family":"Hsu","sequence":"first","affiliation":[]},{"given":"X.-D.","family":"Hu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00222-X_BIB1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0403027","article-title":"Properties of k-connected networks","volume":"3","author":"Bienstock","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB2","doi-asserted-by":"crossref","unstructured":"J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB3","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB4","doi-asserted-by":"crossref","unstructured":"D.Z. Du, F.K. Hwang, An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio, Proceedings of the 31st FOCS, 1990, pp. 76\u201385.","DOI":"10.1109\/FSCS.1990.89526"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB5","doi-asserted-by":"crossref","unstructured":"D.Z. Du, F.K. Hwang, The state of art on Steiner ratio problems, in: D.Z Du, F.K. Hwang (Eds.), Computing in Euclidean Geometry, World Scientific, Singapore, 1995, pp. 195\u2013222.","DOI":"10.1142\/9789812831699_0006"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Comupters and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite set of points","volume":"1","author":"Graham","year":"1972","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB8","first-page":"177","article-title":"Remarks on Steiner minimal trees","volume":"4","author":"Graham","year":"1976","journal-title":"Bull. Inst. Math. Acad. Sinica"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma, M. Store, Design of survivable networks, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Handbook in Operations Research and Management Sciences, vol. 7, Elsevier, 1995.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<133::AID-NET6>3.0.CO;2-C","article-title":"On shortest two-edge-connected Steiner networks with Euclidean distance","volume":"32","author":"Hsu","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-1-4613-3557-3_8","article-title":"On shortest k-edge-connected Steiner networks with rectilinear distance","volume":"4","author":"Hsu","year":"1995","journal-title":"Nonconvex Optim. Appl."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB12","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(99)00222-X_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. AMS"},{"key":"10.1016\/S0166-218X(99)00222-X_BIB15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","article-title":"Minimum-weight two-connected spanning networks","volume":"46","author":"Monma","year":"1990","journal-title":"Math. Prog."},{"key":"10.1016\/S0166-218X(99)00222-X_BIB16","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"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9900222X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9900222X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T16:18:27Z","timestamp":1578500307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9900222X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X9900222X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00222-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}