{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:21Z","timestamp":1781345721611,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679967","type":"print"},{"value":"9783540444367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_26","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T05:33:14Z","timestamp":1182144794000},"page":"262-273","source":"Crossref","is-referenced-by-count":19,"title":["Factor 4\/3 Approximations for Minimum 2-Connected Subgraphs"],"prefix":"10.1007","author":[{"given":"Santosh","family":"Vempala","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Carr, R., Ravi, R.: A new bound for the 2-edge connected subgraph problem. Proc 6th Annual International IPCO (1998)","DOI":"10.1007\/3-540-69346-7_9"},{"key":"26_CR2","unstructured":"Cheriyan, J., Seb\u00f6, A., Sigeti, Z.: Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph. Proc 6th Annual International IPCO (1998)"},{"key":"26_CR3","unstructured":"N. Garg, A. Singla, S. Vempala, Improved approximations for biconnected subgraphs via better lower bounding techniques. Proc 6th Annual SODA (1993)"},{"key":"26_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, Geometric algorithms and combinatorial optimization. Springer-Verlag, New York (1988)"},{"key":"26_CR5","volume-title":"Extensions of Matching Theory","author":"D. Hartvigsen","year":"1984","unstructured":"D. Hartvigsen, Extensions of Matching Theory. Ph.D. thesis, GSIA, Carnegie Mellon University (1984)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings. Journal of the ACM 41 (1994) 214\u201335","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:55:00Z","timestamp":1556495700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}