{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T08:07:05Z","timestamp":1747901225790},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10852-004-6390-x","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T14:16:54Z","timestamp":1116944214000},"page":"199-217","source":"Crossref","is-referenced-by-count":12,"title":["A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space"],"prefix":"10.1007","volume":"4","author":[{"given":"Badri","family":"Toppur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. MacGregor","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6390_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"B. Barber","year":"1996","unstructured":"Barber, B., Dobkin, D. P. and Huhdanpaa, H.: The quickhull algorithm for convex hulls, ACM Trans. on Math. Software 22(4) (1996), 469\u2013483.","journal-title":"ACM Trans. on Math. Software"},{"key":"6390_CR2","volume-title":"What is Mathematics","author":"R. Courant","year":"1941","unstructured":"Courant, R. and Robbins, H.: What is Mathematics?, Oxford University Press, New York, 1941."},{"key":"6390_CR3","unstructured":"Coxeter, H. S. M.: Introduction to Geometry, Wiley, 1961."},{"key":"6390_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/jcta.1996.0040","volume":"74","author":"D. Z. Du","year":"1996","unstructured":"Du, D. Z. and Smith, W. D.: Disproofs of generalized Gilbert\u2013Pollak conjecture on the Steiner ratio in three or more dimensions, J. Combin. Theory Ser. A 74 (1996), 115\u2013130.","journal-title":"J. Combin. Theory Ser. A"},{"key":"6390_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D. Z. Du","year":"1992","unstructured":"Du, D. Z. and Hwang, F. K.: A proof of the Gilbert\u2013Pollak conjecture on the Steiner ratio, Algorithmica 7 (1992), 121\u2013135.","journal-title":"Algorithmica"},{"key":"6390_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1142\/9789814355858_0006","volume-title":"Computing in Euclidean Geometry","author":"S. J. Fortune","year":"1992","unstructured":"Fortune, S. J.: Voronoi diagrams and Delaunay triangulations, in D. Z. Du and F. K. Hwang (eds), Computing in Euclidean Geometry, World Scientific, Singapore, 1992, pp. 193\u2013233."},{"issue":"4","key":"6390_CR7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"Garey, M. R., Graham, R. L. and Johnson, D. S.: The complexity of computing Steiner minimal trees, SIAM J. Appl. Math. 32(4) (1977), 835\u2013859.","journal-title":"SIAM J. Appl. Math."},{"key":"6390_CR8","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M. R Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability; A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979."},{"key":"6390_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. N. Gilbert","year":"1968","unstructured":"Gilbert, E. N. and Pollak, H. O.: Steiner minimal trees, SIAM J. Appl. Math. 16 (1968), 1\u201329.","journal-title":"SIAM J. Appl. Math."},{"key":"6390_CR10","doi-asserted-by":"crossref","unstructured":"Kruskal, J. B.: On the shortest spanning subtree of a graph and the TSP, Proc. Amer. Math. Soc. (1956), 48\u201350.","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"6390_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"Z. A. Melzak","year":"1961","unstructured":"Melzak, Z. A.: On the problem of Steiner, Canad. Math. Bull. 4 (1961), 143\u2013148.","journal-title":"Canad. Math. Bull."},{"key":"6390_CR12","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.: Shortest connection networks and some generalizations, Bell System Tech. J. 36 (1957), 1389\u20131401.","journal-title":"Bell System Tech. J."},{"key":"6390_CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230260411","volume":"25","author":"J. MacGregor Smith","year":"1995","unstructured":"MacGregor Smith, J., Weiss, R. and Patel, M.: An O(N2) heuristic for Steiner minimal trees in E3, Networks 25 (1995), 273\u2013289.","journal-title":"Networks"},{"key":"6390_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"W. D. Smith","year":"1992","unstructured":"Smith, W. D.: How to find Steiner minimal trees in Euclidean d-space, Algorithmica 7 (1992), 137\u2013177.","journal-title":"Algorithmica"},{"key":"6390_CR15","doi-asserted-by":"crossref","unstructured":"Smith, W. D. and MacGregor Smith, J.: On the Steiner ratio in 3-space, J. Combin. Theory (1995).","DOI":"10.1016\/0097-3165(95)90055-1"},{"key":"6390_CR16","series-title":"CBMS\u2013NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"Tarjan, R. E.: Data Structures and Network Algorithms, CBMS\u2013NSF Regional Conference Series in Applied Mathematics 44, SIAM, Philadelphia, PA, 1983."},{"key":"6390_CR17","doi-asserted-by":"crossref","unstructured":"Warme, D. M., Winter, P. and Zachariasen, M.: Exact algorithms for plane Steiner tree problems: A computational study, in D. Z. Du, J. M. Smith and J. H. Rubinstein (eds), Advances in Steiner Trees, Kluwer Academic Publishers, 2000, pp. 81\u2013116.","DOI":"10.1007\/978-1-4757-3171-2_6"},{"key":"6390_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: A survey, Networks 17 (1987), 129\u2013167.","journal-title":"Networks"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-004-6390-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-004-6390-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-004-6390-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T11:41:06Z","timestamp":1586259666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-004-6390-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["6390"],"URL":"https:\/\/doi.org\/10.1007\/s10852-004-6390-x","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}