{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:36:49Z","timestamp":1725521809604},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_14","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"150-162","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation"],"prefix":"10.1007","author":[{"given":"Anna","family":"Galluccio","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison Wesley, (1974).","key":"14_CR1"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R.E. Tarjan, Augmentation problems, SIAM Journal on Computing, 5 (1976) 653\u2013665.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM Journal on Discrete Mathematics, 5 (1992) 25\u201353.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"G.N. Frederickson and J. J\u00e1j\u00e1, Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing, 10(2) (1981) 270\u2013283.","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Application of a poset representation to edge-connectivity and graph rigidity, Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS\u201991), IEEE Computer Society, 812\u2013821.","key":"14_CR5","DOI":"10.1109\/SFCS.1991.185453"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H.N. Gabow","year":"1986","unstructured":"H.N. Gabow, Z. Galil, T. Spencer and R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, 6 (1986) 109\u2013122.","journal-title":"Combinatorica"},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-45678-3_30","volume-title":"Proc. 12th Ann. Int. Symp. on Algorithms and Computation (ISAAC\u201901)","author":"A. Galluccio","year":"2001","unstructured":"A. Galluccio and G. Proietti, Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian paths, Proc. 12th Ann. Int. Symp. on Algorithms and Computation (ISAAC\u201901), December 19-21, 2001, Christchurch, New Zealand, Vol. 2223 of Lecture Notes in Computer Science, Springer, 345\u2013354."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, 13(2) (1984) 338\u2013355.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S. Khuller","year":"1993","unstructured":"S. Khuller and R. Thurimella, Approximation algorithms for graph augmentation, Journal of Algorithms, 14(2) (1993) 214\u2013225.","journal-title":"Journal of Algorithms"},{"key":"14_CR10","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S. Khuller","year":"1996","unstructured":"S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-Hard Problems, Dorit S. Hochbaum Eds., PWS Publishing Company, Boston, MA, 1996."},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48686-0_3","volume-title":"Proc. 5th Annual International Computing and Combinatorics Conference (COCOON\u201999)","author":"H. Nagamochi","year":"1999","unstructured":"H. Nagamochi and T. Ibaraki, An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, Proc. 5th Annual International Computing and Combinatorics Conference (COCOON\u201999), Vol. 1627 of Lecture Notes in Computer Science, Springer, 31\u201340."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, Efficiency of a good but not linear set union algorithm, Journal of the ACM, 22 (1975) 215\u2013225.","journal-title":"Journal of the ACM"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"R.E. Tarjan, Applications of path compression on balanced trees, Journal of the ACM, 26(4) (1979) 690\u2013715.","journal-title":"Journal of the ACM"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, Journal of Computer and System Sciences, 35(1) (1987) 96\u2013144.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:50:24Z","timestamp":1551081024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}