{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:27:17Z","timestamp":1771486037646,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_9","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:51:29Z","timestamp":1186055489000},"page":"112-125","source":"Crossref","is-referenced-by-count":17,"title":["A New Bound for the 2-Edge Connected Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Robert","family":"Carr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"9_CR1","first-page":"267","volume-title":"Proceedings of the Princeton Symposium on Mathematical Programming","author":"M. Balinski","year":"1970","unstructured":"M. Balinski. On recent developments in integer programming. In H. W. Kuhn, editor, Proceedings of the Princeton Symposium on Mathematical Programming, pages 267\u2013302. Princeton University Press, NJ, 1970."},{"key":"9_CR2","unstructured":"S. Boyd and R. Carr. Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Manuscript, March 1998."},{"key":"9_CR3","volume-title":"A new bound for the 2-matching problem","author":"S. Boyd","year":"1996","unstructured":"S. Boyd and R. Carr. A new bound for the 2-matching problem. Report TR-96-07, Department of Computer Science, University of Ottawa, Ottawa, 1996."},{"key":"9_CR4","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. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1976."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"G. N. Fredrickson","year":"1982","unstructured":"G. N. Fredrickson and J. Ja Ja. On the relationship between the biconnectivity augmentation and traveling salesman problems. Theoretical Computer Science, 19:189\u2013201, 1982.","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","first-page":"335","volume":"69","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans. Worst-case comparison of valid inequalities for the TSP. Math. Programming, 69:335\u2013349, 1995.","journal-title":"Math. Programming"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"145","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. Math. Programming, 60:145\u2013166, 1993.","journal-title":"Math. Programming"},{"key":"9_CR8","unstructured":"M. X. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, \u00c9. Tardos, and D. P. Willamson. Approximation algorithms for network design problems. Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 94), pages 223\u2013232, 1994."},{"issue":"2","key":"9_CR9","doi-asserted-by":"crossref","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. J. Assoc. Comput. Mach., 41(2):214\u2013235, 1994.","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR10","unstructured":"P. Klein and R. Ravi. When cycles collapse: A general approximation technique for constrained two-connectivity problems. Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO\u2019 93), pages 39\u201356, 1993."},{"key":"9_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. Math. Programming, 46:153\u2013171, 1990.","journal-title":"Math. Programming"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","volume":"37","author":"C. L. Monma","year":"1989","unstructured":"C. L. Monma and D. F. Shallcross. Methods for designing communication networks with certain two-connectivity survivability constraints. Oper. Res., 37:531\u2013541, 1989.","journal-title":"Oper. Res."},{"key":"9_CR13","unstructured":"H. Saran, V. Vazirani, and N. Young. A primal-dual approach to approximation algorithms for network Steiner problems. Proc. of the Indo-US workshop on Cooperative research in Computer Science, pages 166\u2013168. Bangalore, India, 1992."},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","volume":"CT-16","author":"K. Steiglitz","year":"1969","unstructured":"K. Steiglitz, P. Weiner, and D. J. Kleitman. The design of minimum-cost survivable networks. IEEE Trans. on Circuit Theory, CT-16,4:455\u2013460, 1969.","journal-title":"IEEE Trans. on Circuit Theory"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D. B. Shmoys","year":"1990","unstructured":"D. B. Shmoys and D. P. Williamson. Analyzing the Held-Karp TSP bound: A monotonicity property with application, Inf. Process. Lett., 35:281\u2013285, 1990.","journal-title":"Inf. Process. Lett."},{"key":"9_CR16","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. Math. Program. Study, 13:121\u2013134, 1980.","journal-title":"Math. Program. Study"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BF01299747","volume":"15","author":"D. P. Williamson","year":"1995","unstructured":"D. P. Williamson, M. X. Goemans, M. Mihail, and V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15:435\u2013454, 1995.","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T11:40:18Z","timestamp":1538653218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}