{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:42Z","timestamp":1725489822689},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_5","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T06:18:03Z","timestamp":1187590683000},"page":"39-51","source":"Crossref","is-referenced-by-count":2,"title":["A 4\/3-Approximation Algorithm for Minimum 3-Edge-Connectivity"],"prefix":"10.1007","author":[{"given":"Prabhakar","family":"Gubbala","sequence":"first","affiliation":[]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1137\/S009753979833920X","volume":"30","author":"J. Cheriyan","year":"2000","unstructured":"Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via matching. SIAM J. Comput.\u00a030(2), 528\u2013560 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480102405476","volume":"18","author":"H.N. Gabow","year":"2004","unstructured":"Gabow, H.N.: An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SIAM J. Discrete Math.\u00a018(1), 41\u201370 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR3","unstructured":"Gabow, H.N., Goemans, M.X., Tardos, \u00c9., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. In: SODA, pp. 562\u2013571. SIAM (2005)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11496915_31","volume-title":"IPCO 2005","author":"P. Gubbala","year":"2005","unstructured":"Gubbala, P., Raghavachari, B.: Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 422\u2013436. Springer, Heidelberg (2005)"},{"key":"5_CR5","unstructured":"Jothi, R., Raghavachari, B., Varadarajan, S.: A 5\/4-approximation algorithm for minimum 2-edge-connectivity. In: SODA, pp. 725\u2013734 (2003)"},{"issue":"2","key":"5_CR6","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":"5_CR7","first-page":"236","volume-title":"Approximation algorithms for NP-hard problems, ch. 6","author":"S. Khuller","year":"1997","unstructured":"Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Approximation algorithms for NP-hard problems, ch. 6, pp. 236\u2013265. PWS Publishing Co., Boston, MA (1997)"},{"key":"5_CR8","series-title":"Computer & Information Science Series","volume-title":"Handbook of Approximation Algorithms and Metaheuristics, ch. 58","author":"G. Kortsarz","year":"2007","unstructured":"Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Handbook of Approximation Algorithms and Metaheuristics, ch. 58. Computer & Information Science Series, vol.\u00a010, Chapman & Hall\/CRC, Sydney, Australia (2007)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44436-X_26","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S. Vempala","year":"2000","unstructured":"Vempala, S., Vetta, A.: Factor 4\/3 approximations for minimum 2-connected subgraphs. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 262\u2013273. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:06:02Z","timestamp":1619503562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}