{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:46:16Z","timestamp":1743101176420,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_16","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"159-171","source":"Crossref","is-referenced-by-count":0,"title":["Augmenting the Edge-Connectivity of a Spider Tree"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-36206-1_7","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"H.-J. B\u00f6ckenhauer","year":"2002","unstructured":"B\u00f6ckenhauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 59\u201370. Springer, Heidelberg (2002)"},{"key":"16_CR2","series-title":"LNCS","volume-title":"30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004)","author":"M. Conforti","year":"2004","unstructured":"Conforti, M., Galluccio, A., Proietti, G.: Augmentation problems and network matrices. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004). LNCS. Springer, Heidelberg (2004)"},{"issue":"4","key":"16_CR3","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":"16_CR4","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":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e0J\u00e0, J.: Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR6","unstructured":"Gabow, H.N.: Data strucutures for weighted matching and nearest common ancestors with linking. In: 1st Symp. on Discrete Algorithms (SODA 1990), pp. 434\u2013443."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Application of a poset representation to edge-connectivity and graph rigidity. In: 32nd IEEE Symp. on Found. of Computer Science (FOCS 1991), pp. 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"issue":"4","key":"16_CR8","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 2-edge-connectivity augmentation problems. Algorithmica\u00a036(4), 361\u2013374 (2003)","journal-title":"Algorithmica"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45465-9_31","volume-title":"Automata, Languages and Programming","author":"L. Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 355\u2013365. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_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"},{"issue":"1","key":"16_CR11","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"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"A. Nakamura","year":"1987","unstructured":"Nakamura, A., Watanabe, T.: Edge-connectivity augmentation problems. Journal of Computer and System Science\u00a035(1), 96\u2013144 (1987)","journal-title":"Journal of Computer and System Science"},{"key":"16_CR13","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, New Jersey (1982)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:10Z","timestamp":1740261130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}