{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:48:08Z","timestamp":1649177288474},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":[[1997,2]]},"DOI":"10.1016\/s0167-6377(96)00046-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"81-84","source":"Crossref","is-referenced-by-count":3,"title":["On finding two-connected subgraphs in planar graphs"],"prefix":"10.1016","volume":"20","author":[{"given":"J.Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(96)00046-6_BIB1","article-title":"Minimal connected enclosures on an embedded planar graph","author":"Alexopoulos","year":"1995-1995"},{"key":"10.1016\/S0167-6377(96)00046-6_BIB2","article-title":"The 2-edge connected Steiner subgraph polytope of a series-parallel graph","author":"Ba\u00efou","year":"1993"},{"key":"10.1016\/S0167-6377(96)00046-6_BIB3","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"Send and split method for minimum-concave-cost network flows","volume":"12","author":"Erickson","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00046-6_BIB4","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamilonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(96)00046-6_BIB5","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1137\/0403043","article-title":"Integer polyhedra arising from certain network design problems with connectivity constraints","volume":"3","author":"Gr\u00f6tschel","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0167-6377(96)00046-6_BIB6","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0167-6377(96)00046-6_BIB7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","article-title":"Biconnectivity approximations and graph carvings","volume":"41","author":"Khuller","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(96)00046-6_BIB8","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(96)00046-6_BIB9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communications networks with certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00046-6_BIB10","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(96)00046-6_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\/S0167-6377(96)00046-6_BIB12","article-title":"Convexity and the generalized Steiner problem","author":"Talluri","year":"1990"},{"key":"10.1016\/S0167-6377(96)00046-6_BIB13","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. Algorithms"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000466?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000466?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:57Z","timestamp":1555577637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637796000466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0167637796000466"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(96)00046-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}