{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:19:10Z","timestamp":1735582750593},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10732-010-9137-z","type":"journal-article","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T11:53:23Z","timestamp":1278590003000},"page":"353-372","source":"Crossref","is-referenced-by-count":7,"title":["A randomized Delaunay triangulation heuristic for\u00a0the\u00a0Euclidean Steiner tree problem in \u211c d"],"prefix":"10.1007","volume":"17","author":[{"given":"Jon W.","family":"Van Laarhoven","sequence":"first","affiliation":[]},{"given":"Jeffrey W.","family":"Ohlmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"issue":"5","key":"9137_CR1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. Assoc. Comput. Mach. 45(5), 753\u2013782 (1998)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"11","key":"9137_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9137_CR3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230240404","volume":"24","author":"J.E. Beasley","year":"1994","unstructured":"Beasley, J.E., Goffinet, F.: A Delaunay triangulation-based heuristic for the Euclidean Steiner problem. Networks 24(4), 215\u2013224 (1994)","journal-title":"Networks"},{"key":"9137_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0167-5060(08)70332-7","volume":"2","author":"F.R.K. Chung","year":"1978","unstructured":"Chung, F.R.K., Graham, R.L.: Steiner trees for ladders. Ann. Discrete Math. 2, 173\u2013200 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"9137_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1008285504599","volume":"13","author":"D.R. Dreyer","year":"1998","unstructured":"Dreyer, D.R., Overton, M.L.: Two heuristics for the Euclidean Steiner tree problem. J. Glob. Optim. 13(1), 95\u2013106 (1998)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9137_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D.Z. Du","year":"1992","unstructured":"Du, D.Z., Hwang, F.K.: A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica 7(1), 121\u2013135 (1992)","journal-title":"Algorithmica"},{"issue":"2","key":"9137_CR7","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.disopt.2007.08.006","volume":"5","author":"M. Fampa","year":"2008","unstructured":"Fampa, M., Anstreicher, K.M.: An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discrete Optim. 5(2), 530\u2013540 (2008)","journal-title":"Discrete Optim."},{"issue":"4","key":"9137_CR8","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., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9137_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"9137_CR10","volume-title":"Design and Analysis of Experiments","author":"D.C. Montgomery","year":"2001","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 5th edn. Wiley, New York (2001)","edition":"5"},{"key":"9137_CR11","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 2nd edn. Springer, New York (1988)","edition":"2"},{"key":"9137_CR12","doi-asserted-by":"crossref","unstructured":"Rao, S.B., Smith, W.D.: Improved approximation schemes for geometrical graphs via \u201cspanners\u201d and \u201cbanyans\u201d. In 30th ACM Symposium on Theory of Computing, pp.\u00a0540\u2013550 (1998)","DOI":"10.1145\/276698.276868"},{"issue":"8","key":"9137_CR13","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/net.3230240802","volume":"24","author":"S. Ravada","year":"1994","unstructured":"Ravada, S., Sherman, A.T.: Experimental evaluation of a partitioning algorithm for the Steiner tree problem in R 2 and R 3. Networks 24(8), 409\u2013415 (1994)","journal-title":"Networks"},{"issue":"1","key":"9137_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(1), 137\u2013177 (1992)","journal-title":"Algorithmica"},{"key":"9137_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"J.M. Smith","year":"1981","unstructured":"Smith, J.M., Lee, D.T., Liebman, J.S.: An O(Nlog\u2009N) heuristic for Steiner minimal tree problems on the Euclidean metric. Networks 11, 23\u201329 (1981)","journal-title":"Networks"},{"issue":"4","key":"9137_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230260411","volume":"26","author":"J.M. Smith","year":"1995","unstructured":"Smith, J.M., Weiss, R., Patel, M.: An O(N 2) heuristic for Steiner minimal trees in E 3. Networks 26(4), 273\u2013289 (1995)","journal-title":"Networks"},{"key":"9137_CR17","unstructured":"Sturm, J.F., Polik, I.: SeDuMi: self dual minimization version 1.1 (2006)"},{"issue":"3","key":"9137_CR18","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1111\/j.1469-1809.1973.tb00595.x","volume":"36","author":"E.A. Thompson","year":"1973","unstructured":"Thompson, E.A.: The method of minimum evolution, Ann. Hum. Genet. 36(3), 333\u2013340 (1973)","journal-title":"Hum. Genet."},{"issue":"2","key":"9137_CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10852-004-6390-x","volume":"4","author":"B. Toppur","year":"2005","unstructured":"Toppur, B., Smith, J.M.G.: A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space. J. Math. Model. Algorithms 4(2), 199\u2013217 (2005)","journal-title":"J. Math. Model. Algorithms"},{"key":"9137_CR20","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU) (2001)"},{"issue":"2","key":"9137_CR21","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(99)00131-9","volume":"119","author":"M. Zachariasen","year":"1999","unstructured":"Zachariasen, M.: Local search for the Steiner tree problem in the Euclidean plane. Eur. J. Oper. Res. 119(2), 282\u2013300 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9137_CR22","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/PL00009287","volume":"25","author":"M. Zachariasen","year":"1999","unstructured":"Zachariasen, M., Winter, P.: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem. Algorithmica 25(4), 418\u2013437 (1999)","journal-title":"Algorithmica"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9137-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9137-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9137-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:31Z","timestamp":1559242471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9137-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9137"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9137-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,9]]}}}