{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:20:57Z","timestamp":1649002857131},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":6194,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0012-365x(94)00368-s","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"39-48","source":"Crossref","is-referenced-by-count":5,"title":["Steiner minimal trees in Lp2"],"prefix":"10.1016","volume":"155","author":[{"given":"Dietmar","family":"Cieslik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Linhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00368-S_BIB1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1038\/scientificamerican0189-84","article-title":"The shortest network problem","volume":"260","author":"Bern","year":"1989","journal-title":"Sci. Amer."},{"key":"10.1016\/0012-365X(94)00368-S_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(90)90054-2","article-title":"An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs","volume":"35","author":"Chang","year":"1990","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0012-365X(94)00368-S_BIB3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(94)00368-S_BIB4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","article-title":"A new bound for Euclidean Steiner minimal trees","volume":"440","author":"Chung","year":"1985","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"10.1016\/0012-365X(94)00368-S_BIB5","article-title":"Ober B\u00e4ume minimaler L\u00e4nge in der normierten Ebene","author":"Cieslik","year":"1982"},{"key":"10.1016\/0012-365X(94)00368-S_BIB6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/02331938808843367","article-title":"The Fermat-Steiner-Weber-Problem in Minkowski Spaces","volume":"19","author":"Cieslik","year":"1988","journal-title":"Optimization"},{"key":"10.1016\/0012-365X(94)00368-S_BIB7","article-title":"Knotengrade k\u00fcrzester B\u00e4ume in Banach-Minkowski-R\u00e4umen","author":"Cieslik","year":"1989"},{"key":"10.1016\/0012-365X(94)00368-S_BIB8","first-page":"89","article-title":"Knotengrade k\u00fcrzester B\u00e4ume in endlichdimensionalen Banachr\u00e4umen","volume":"39","author":"Cieslik","year":"1990","journal-title":"Rostock. Math, Kolloq"},{"key":"10.1016\/0012-365X(94)00368-S_BIB9","series-title":"Topics in Combinatorics and Graph Theory","first-page":"201","article-title":"The vertex-degrees of Steiner minimal trees in Minkowski planes","author":"Cieslik","year":"1990"},{"key":"10.1016\/0012-365X(94)00368-S_BIB10","series-title":"Contemporary Methods in Graph Theory","first-page":"231","article-title":"The Steiner ratio in Banach Minkowski planes","author":"Cieslik","year":"1990"},{"key":"10.1016\/0012-365X(94)00368-S_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1080\/02331939108843669","article-title":"The 1-Steiner-minimal-tree problem in Minkowski-spaces","volume":"22","author":"Cieslik","year":"1991","journal-title":"Optimization"},{"key":"10.1016\/0012-365X(94)00368-S_BIB12","article-title":"Das Steiner-problem in Banach-Minkowski-R\u00e4umen","author":"Cieslik","year":"1991"},{"key":"10.1016\/0012-365X(94)00368-S_BIB13","series-title":"Proc. 31st Ann. Symp. on Foundations of Computer Science","first-page":"76","article-title":"An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio","author":"Du","year":"1990"},{"key":"10.1016\/0012-365X(94)00368-S_BIB14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01758757","article-title":"On Steiner minimal trees with Lp-distance","volume":"7","author":"Du","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0012-365X(94)00368-S_BIB15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01588313","article-title":"Weber's problem and Weiszfeld's algorithm in general spaces","volume":"18","author":"Eckhardt","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(94)00368-S_BIB16","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","article-title":"The complexity of computing Steiner minimal trees","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(94)00368-S_BIB17","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\/0012-365X(94)00368-S_BIB18","first-page":"459","article-title":"Briefwechsel Gau\u03b2-Schuhmacher","volume":"1","author":"Gau\u03b2","year":"1917","journal-title":"Werke Bd. X"},{"key":"10.1016\/0012-365X(94)00368-S_BIB19","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/0196-6774(87)90032-0","article-title":"The 1-Steiner-problem","volume":"8","author":"Georgakopoulos","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(94)00368-S_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","article-title":"Steiner minimal trees","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(94)00368-S_BIB21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"7","author":"Graham","year":"1985","journal-title":"Ann. Hist. Comput."},{"key":"10.1016\/0012-365X(94)00368-S_BIB22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","article-title":"On Steiners problem with rectilinear distance","volume":"14","author":"Hanan","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(94)00368-S_BIB23","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\/0012-365X(94)00368-S_BIB24","article-title":"Bucketing and filtering in computational geometry","author":"Katajainen","year":"1987"},{"key":"10.1016\/0012-365X(94)00368-S_BIB25","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0167-5060(08)70357-1","article-title":"Selected families of location problems","volume":"5","author":"Krarup","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(94)00368-S_BIB26","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","article-title":"Two dimensional Voronoi diagrams in Lp-metric","volume":"27","author":"Lee","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(94)00368-S_BIB27","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1057\/jors.1972.6","article-title":"Modelling inter-city road distances by mathematical function","volume":"23","author":"Love","year":"1972","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0012-365X(94)00368-S_BIB28","series-title":"Facilities Location \u2014 Models and Methods","author":"Love","year":"1989"},{"key":"10.1016\/0012-365X(94)00368-S_BIB29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","article-title":"An O(nlogn) heuristic for Steiner minimal tree problems on the Euclidean metric","volume":"11","author":"MacGregor Smith","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0012-365X(94)00368-S_BIB30","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1287\/opre.27.6.1180","article-title":"Minimum lp distance location problems solved via a perturbed problem and Weiszfelds algorithm","volume":"27","author":"Morris","year":"1979","journal-title":"Oper. Res."},{"key":"10.1016\/0012-365X(94)00368-S_BIB31","series-title":"Computational Geometry","author":"Preparata","year":"1988"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400368S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400368S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:27Z","timestamp":1556277747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400368S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0012365X9400368S"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00368-s","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}