{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T02:59:32Z","timestamp":1672973972207},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":[[2001,10]]},"DOI":"10.1016\/s0167-6377(01)00094-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:28:48Z","timestamp":1027607328000},"page":"99-106","source":"Crossref","is-referenced-by-count":4,"title":["Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems"],"prefix":"10.1016","volume":"29","author":[{"given":"Anantaram","family":"Balakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Mirchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00094-3_BIB1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.46.1.116","article-title":"Designing hierarchical survivable networks","volume":"46","author":"Balakrishnan","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00094-3_BIB2","unstructured":"A. Balakrishnan, T.L. Magnanti, P. Mirchandani, 2000. Connectivity-splitting models for survivable network design, Working Paper 00-3, Department of Management Science & Information Systems, Pennsylvania State University."},{"key":"10.1016\/S0167-6377(01)00094-3_BIB3","doi-asserted-by":"crossref","unstructured":"Edmonds, J. Maximum matching and a Polyhedron with 0\u20131 vertices, J. Res. Nat. Bureau Standards, 69B (1965) 125\u2013130.","DOI":"10.6028\/jres.069B.013"},{"key":"10.1016\/S0167-6377(01)00094-3_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01580607","article-title":"Survivable networks, linear programming relaxations and the parsimonious property","volume":"60","author":"Goemans","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00094-3_BIB5","unstructured":"M.X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, D.P. Williamson, Approximation schemes for network design problems, Proceedings of the Fifth Annual ACM\/SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 223\u2013232."},{"key":"10.1016\/S0167-6377(01)00094-3_BIB6","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma, M. Stoer, Design of survivable communications networks, in: M.O. Ball et al. (Eds.), Network Models, Handbooks in Operations Research and Management Science, Vol. 7, North-Holland, Amsterdam, 1995, pp. 617\u2013672 [Chapter 10].","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"10.1016\/S0167-6377(01)00094-3_BIB7","doi-asserted-by":"crossref","unstructured":"Jain, K. A factor 2 approximation algorithm for the generalized Steiner network problem, Combinatorica 21 (2001) 39\u201360.","DOI":"10.1007\/s004930170004"},{"key":"10.1016\/S0167-6377(01)00094-3_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(01)00094-3_BIB9","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0167-6377(01)00094-3_BIB10","first-page":"573","article-title":"An approximation solution for the Steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math. Japon."},{"key":"10.1016\/S0167-6377(01)00094-3_BIB11","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF01299747","article-title":"A primal-dual algorithm for generalized steiner network problems","volume":"15","author":"Williamson","year":"1995","journal-title":"Combinatorica"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000943?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000943?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T10:09:10Z","timestamp":1578564550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0167637701000943"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00094-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}