{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:26Z","timestamp":1760439986577},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0167-6377(99)00068-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:08:54Z","timestamp":1027649334000},"page":"111-116","source":"Crossref","is-referenced-by-count":14,"title":["On the structure and complexity of the 2-connected Steiner network problem in the plane"],"prefix":"10.1016","volume":"26","author":[{"given":"Emily Larson","family":"Luebke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Scott","family":"Provan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00068-1_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1006\/jcta.1996.2751","article-title":"Minimal Steiner trees for rectangular arrays of lattice points","volume":"A 79","author":"Brazil","year":"1997","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB2","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\/S0167-6377(99)00068-1_BIB3","first-page":"617","article-title":"Design of survivable networks","volume":"Vol. 7","author":"Gr\u00f6tschel","year":"1995"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","article-title":"On the relationship between the biconnectivity augmentation and traveling salesman problems","volume":"9","author":"Frederickson","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB5","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\/S0167-6377(99)00068-1_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","article-title":"A proof of Gilbert and Pollack's conjecture on the Steiner ratio","volume":"7","author":"Hu","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(86)90008-8","article-title":"A linear time algorithm for full Steiner trees","volume":"4","author":"Hwang","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB8","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB9","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamiltonian paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB10","series-title":"The Traveling Salesman Problem","first-page":"37","author":"Johnson","year":"1986"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","article-title":"On the problem of Steiner","volume":"4","author":"Melzak","year":"1961","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB12","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. Programming"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB13","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"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB14","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1137\/0217057","article-title":"An approximation scheme for finding Steiner trees with obstacles","volume":"17","author":"Provan","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(99)00068-1_BIB15","doi-asserted-by":"crossref","unstructured":"J.S. Provan, A fully polynomial approximation scheme for the Euclidean Steiner augmentation problem, in: D.-Z. Du, J.M. Smith, J.H. Rubinstein (Eds.), Advances in Steiner Trees, Kluwer Academic Publishers, Dordrecht, 2000, pp. 235\u2013253.","DOI":"10.1007\/978-1-4757-3171-2_11"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB16","series-title":"Issues in the design and analysis of survivable networks, Ph.D. Thesis, Massachusetts Institute of Technology","author":"Talluri","year":"1991"},{"key":"10.1016\/S0167-6377(99)00068-1_BIB17","doi-asserted-by":"crossref","unstructured":"D.M. Warme, P. Winter, M. Zachariasen, Exact algorithms for plane Steiner tree problems: a computational study, in: D.-Z. Du, J.M. Smith, J.H. Rubinstein (Eds.), Advances in Steiner trees, Kluwer Academic Publishers, Dordrecht, 2000, pp. 81\u2013116.","DOI":"10.1007\/978-1-4757-3171-2_6"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000681?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000681?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:53:14Z","timestamp":1555289594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0167637799000681"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00068-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}