{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:30:04Z","timestamp":1743082204989,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_40","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"485-501","source":"Crossref","is-referenced-by-count":9,"title":["The Two-Edge Connectivity Survivable Network Problem in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/11561071_43","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Berger","year":"2005","unstructured":"Berger, A., Czumaj, A., Grigni, M., Zhao, H.: Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 472\u2013483. Springer, Heidelberg (2005)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-73420-8_10","volume-title":"Automata, Languages and Programming","author":"A. Berger","year":"2007","unstructured":"Berger, A., Grigni, M.: Minimum weight 2-edge-connected spanning subgraphs in planar graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 90\u2013101. Springer, Heidelberg (2007)"},{"key":"40_CR4","unstructured":"Borradaile, G., Kenyon-Mathieu, C., Klein, P.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: 18th SODA, pp. 1285\u20131294 (2007)"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-73951-7_25","volume-title":"Algorithms and Data Structures","author":"G. Borradaile","year":"2007","unstructured":"Borradaile, G., Klein, P., Mathieu, C.: Steiner tree in planar graphs: An O(n logn) approximation scheme with singly exponential dependence on epsilon. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 275\u2013286. Springer, Heidelberg (2007)"},{"key":"40_CR6","unstructured":"Czumaj, A., Lingas, A.: On approximability of the minimum cost k-connected spanning subgraph problem. In: 10th SODA, pp. 281\u2013290 (1999)"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R. Erickson","year":"1987","unstructured":"Erickson, R., Monma, C., Veinott, A.: Send-and-split method for minimum-concave-cost network flows. Math. Op. Res.\u00a012, 634\u2013664 (1987)","journal-title":"Math. Op. Res."},{"issue":"4","key":"40_CR8","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. Eswaran","year":"1976","unstructured":"Eswaran, K., Tarjan, R.: Augmentation problems. SIAM J. Comput.\u00a05(4), 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G. Frederickson","year":"1981","unstructured":"Frederickson, G., J\u00e1j\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput.\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"key":"40_CR10","unstructured":"Goemans, M., Goldberg, A., Plotkin, S., Shmoys, D., Tardos, \u00c9., Williamson, D.: Improved approximation algorithms for network design problems. In: 5th SODA, pp. 223\u2013232 (1994)"},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M. Henzinger","year":"1997","unstructured":"Henzinger, M., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. System Sci.\u00a055(1), 3\u201323 (1997)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"40_CR13","unstructured":"Jothi, R., Raghavachari, B., Varadarajan, S.: A 5\/4-approximation algorithm for minimum 2-edge-connectivity. In: 14th SODA, pp. 725\u2013734 (2003)"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM\u00a041(2), 214\u2013235 (1994)","journal-title":"J. ACM"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Klein, P.: A linear-time approximation scheme for planar weighted TSP. In: 46th FOCS, pp. 647\u2013647 (2005)","DOI":"10.1109\/SFCS.2005.7"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Klein, P.: A subset spanner for planar graphs, with application to subset TSP. In: 38th STOC, pp. 749\u2013756 (2006)","DOI":"10.1145\/1132516.1132620"},{"key":"40_CR17","unstructured":"Klein, P., Ravi, R.: When cycles collapse: A general approximation technique for constraind two-connectivity problems. In: 3rd IPCO, pp. 39\u201355 (1993)"},{"key":"40_CR18","unstructured":"Ravi, R.: Approximation algorithms for Steiner augmentations for two-connectivity. Technical Report TR-CS-92-21, Brown University (1992)"},{"volume-title":"Handbook of Optimization in Telecommunications","year":"2006","key":"40_CR19","unstructured":"Resende, M., Pardalos, P. (eds.): Handbook of Optimization in Telecommunications. Springer, Heidelberg (2006)"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Williamson, D., Goemans, M., Mihail, M., Vazirani, V.: A primal-dual approximation algorithm for generalized Steiner network problems. In: 35th STOC, pp. 708\u2013717 (1993)","DOI":"10.1145\/167088.167268"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:13Z","timestamp":1738325593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}