{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:57Z","timestamp":1725558957100},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_30","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"355-364","source":"Crossref","is-referenced-by-count":6,"title":["Edge-Connectivity Augmentation and Network Matrices"],"prefix":"10.1007","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"Anna","family":"Galluccio","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM Journal on Computing\u00a05(4), 653\u2013665 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-44666-4_13","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"G. Even","year":"2001","unstructured":"Even, G., Feldman, J., Kortsarz, G., Nutov, Z.: A 3\/2-approximation algorithm for augmenting the edge-connectivity of a graph from 1 to 2 using a subset of a given edge set. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 90\u2013101. Springer, Heidelberg (2001)"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Mathematics\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1j\u00e1, J.: Approximation algorithm for several graph augmentation problems. SIAM Journal on Computing\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/SFCS.1991.185453","volume-title":"Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS 1991)","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N.: Application of a poset representation to edge-connectivity and graph rigidity. In: Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS 1991), pp. 812\u2013821. IEEE Computer Society, Los Alamitos (1991)"},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00453-003-1024-7","volume":"36","author":"A. Galluccio","year":"2003","unstructured":"Galluccio, A., Proietti, G.: Polynomial time algorithms for edge-connectivity augmentation problems. Algorithmica\u00a036(4), 361\u2013374 (2003)","journal-title":"Algorithmica"},{"key":"30_CR7","volume-title":"Approximation Algorithms for NPHard Problems","author":"D.S. Hochbaum","year":"1996","unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NPHard Problems. PWS Publishing Company, Boston (1996)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01585160","volume":"62","author":"D.S. Hochbaum","year":"1993","unstructured":"Hochbaum, D.S., Megiddo, N., Naor, J.S., Tamir, A.: Tight bounds and 2- approximation algorithms for integer programs with two variables per inequality. Mathematical Programming\u00a062, 69\u201383 (1993)","journal-title":"Mathematical Programming"},{"key":"30_CR9","first-page":"223","volume-title":"Linear Inequalities and Related Systems","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 223\u2013246. Princeton University Press, New Jersey (1956)"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S. Khuller","year":"1993","unstructured":"Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. Journal of Algorithms\u00a014(2), 214\u2013225 (1993)","journal-title":"Journal of Algorithms"},{"key":"30_CR11","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S. Khuller","year":"1996","unstructured":"Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1996)"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00218-4","volume":"126","author":"H. Nagamochi","year":"2003","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics\u00a0126(1), 83\u2013113 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR13","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1986","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. J. Wiley & Sons, Chichester (1986)"},{"key":"30_CR14","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1986)"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. Journal of Computer and System Sciences\u00a035(1), 96\u2013144 (1987)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:01Z","timestamp":1620012601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}