{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:41:35Z","timestamp":1649000495083},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645900","type":"print"},{"value":"9783540693468","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_10","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"126-136","source":"Crossref","is-referenced-by-count":8,"title":["An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Cheriyan","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Integer Programming and Combinatorial Optimization: Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization","author":"R. Carr","year":"1998","unstructured":"R. Carr and R. Ravi. A new bound for the 2-edge connected subgraph problem. In R. E. Bixby, E. A. Boyd, and R. Z. R\u00edos-Mercado, editors, Integer Programming and Combinatorial Optimization: Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization, LNCS, Vol. 1412, pages 110\u2013123. Springer, 1998. This volume."},{"key":"10_CR2","unstructured":"J. Cheriyan and R. Thurimella. Approximating minimum-size k-connected spanning subgraphs via matching. Proc. 37th Annual IEEE Sympos. on Foundat. of Comput. Sci., pages 292\u2013301, 1996."},{"key":"10_CR3","volume-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"N. Christofides","year":"1976","unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, G.S.I.A., Carnegie-Mellon Univ., Pittsburgh, PA, 1976."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01202790","volume":"13","author":"A. Frank","year":"1993","unstructured":"A. Frank. Conservative weightings and ear-decompositions of graphs. Combinatorica, 13:65\u201381, 1993.","journal-title":"Combinatorica"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"G. L. Frederickson","year":"1982","unstructured":"G. L. Frederickson and J. Ja\u2019Ja\u2019. On the relationship between the biconnectivity augmentation and traveling salesman problems. Theor. Comp. Sci., 19:189\u2013201, 1982.","journal-title":"Theor. Comp. Sci."},{"key":"10_CR6","unstructured":"N. Garg, V. S. Santosh, and A. Singla. Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques. Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 103\u2013111, 1993."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01580607","volume":"60","author":"M. X. Goemans","year":"1993","unstructured":"M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming, 60:143\u2013166, 1993.","journal-title":"Mathematical Programming"},{"key":"10_CR8","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:214\u2013235, 1994. Preliminary version in Proc. 24th Annual ACM STOC, pages 759\u2013770, 1992.","journal-title":"Journal of the ACM"},{"key":"10_CR9","first-page":"279","volume":"7","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz. A note on factor-critical graphs. Studia Sci. Math. Hungar., 7:279\u2013280, 1972.","journal-title":"Studia Sci. Math. Hungar."},{"key":"10_CR10","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. D. Plummer. Matching Theory. Akad\u00e9miai Kiad\u00f3, Budapest, 1986."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C. L. Monma","year":"1990","unstructured":"C. L. Monma, B. S. Munson, and W. R. Pulleyblank. Minimum-weight two-connected spanning networks. Mathematical Programming, 46:153\u2013171, 1990.","journal-title":"Mathematical Programming"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.2307\/1989545","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney. Nonseparable and planar graphs. Trans. Amer. Math. Soc., 34:339\u2013362, 1932.","journal-title":"Trans. Amer. Math. Soc."},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L. A. Wolsey","year":"1980","unstructured":"L. A. Wolsey. Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study, 13:121\u2013134, 1980","journal-title":"Mathematical Programming Study"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T16:33:51Z","timestamp":1550421231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":13,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-69346-7_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1998]]}}}