{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:44:44Z","timestamp":1648813484003},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00095-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"25-38","source":"Crossref","is-referenced-by-count":0,"title":["Minimal connected enclosures on an embedded planar graph"],"prefix":"10.1016","volume":"91","author":[{"given":"Christos","family":"Alexopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Scott","family":"Provan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.Donald","family":"Ratliff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bryan R.","family":"Stutzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00095-X_BIB1","series-title":"Complex Analysis","author":"Alfors","year":"1966"},{"issue":"1","key":"10.1016\/S0166-218X(98)00095-X_BIB2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","article-title":"On the complexity of covering vertices by faces in a planar graph","volume":"17","author":"Bienstock","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(98)00095-X_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230190107","article-title":"Optimal enclosing regions in planar graphs","volume":"19","author":"Bienstock","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB4","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB5","first-page":"195","article-title":"The Steiner problem in graphs","volume":"2","author":"Dreyfus","year":"1972","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"The scnd-and-split method for minimum-concave-cost network flows","volume":"12","author":"Erickson","year":"1987","journal-title":"Math. Oper. Res."},{"issue":"6","key":"10.1016\/S0166-218X(98)00095-X_BIB7","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","article-title":"Fast algorithms for shortest paths in planar graphs, with applications","volume":"16","author":"Frederickson","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(98)00095-X_BIB8","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garcy","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00095-X_BIB9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and its applications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB10","series-title":"Integer and Combinatorial Programming","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(89)90129-4","article-title":"Shortest enclosing walks and cycles in embedded graphs","volume":"30","author":"Provan","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(98)00095-X_BIB12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0167-6377(96)00046-6","article-title":"On finding two-connected subgraphs in planar graphs","volume":"20","author":"Provan","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(98)00095-X_BIB13","article-title":"The Steiner Tree Problem","author":"Richards","year":"1992"},{"key":"10.1016\/S0166-218X(98)00095-X_BIB14","article-title":"Zone formation problems on embedded planar graphs","author":"Stutzman","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800095X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9800095X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:53:04Z","timestamp":1556117584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9800095X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X9800095X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00095-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}