{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:27Z","timestamp":1760244987723,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0893-9659(02)00053-8","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T14:05:17Z","timestamp":1035209117000},"page":"855-860","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Steiner's problem in double trees"],"prefix":"10.1016","volume":"15","author":[{"given":"D.","family":"Cieslik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Dress","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Fitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(02)00053-8_BIB1","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\/S0893-9659(02)00053-8_BIB2","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1962"},{"year":"1976","author":"Lawler","key":"10.1016\/S0893-9659(02)00053-8_BIB3"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB4","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\/S0893-9659(02)00053-8_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problems in networks: A survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","article-title":"Generalized Steiner problem in series-parallel networks","volume":"7","author":"Winter","year":"1986","journal-title":"J. of Algorithms"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"},{"year":"1998","author":"Cieslik","key":"10.1016\/S0893-9659(02)00053-8_BIB8"},{"year":"2000","key":"10.1016\/S0893-9659(02)00053-8_BIB9"},{"year":"1992","author":"Hwang","key":"10.1016\/S0893-9659(02)00053-8_BIB10"},{"year":"1990","author":"Vo\u00df","key":"10.1016\/S0893-9659(02)00053-8_BIB11"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230070104","article-title":"Rectilinear Steiner trees: Efficient-special-case-algorithms","volume":"7","author":"Aho","year":"1977","journal-title":"Networks"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01758761","article-title":"A linear-time algorithm to construct a rectilinear Steiner minimal tree for k-extremal point sets","volume":"7","author":"Richards","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230250206","article-title":"Thirty-five-point rectilinear Steiner minimal trees in a day","volume":"25","author":"Salowe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB15","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\/S0893-9659(02)00053-8_BIB16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-19488-6_105","article-title":"What problems are easy for tree-decomposable graphs","volume":"317","author":"Arnborg","year":"1988","journal-title":"Lecture Notes Computer Science"},{"year":"1989","author":"Scheffler","key":"10.1016\/S0893-9659(02)00053-8_BIB17"},{"key":"10.1016\/S0893-9659(02)00053-8_BIB18","unstructured":"D. Cieslik, A. Dress, K.T. Huber and V. Moulton, Embedding Complexity: A New Approach to Discrete Optimization Using Divide & Conquer, Exemplified with the Steiner Tree Problem, (in preparation)."},{"key":"10.1016\/S0893-9659(02)00053-8_BIB19","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"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000538?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965902000538?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:07:08Z","timestamp":1760238428000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965902000538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0893965902000538"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(02)00053-8","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Steiner's problem in double trees","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(02)00053-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}