{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:27:05Z","timestamp":1747654025140,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_11","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T01:43:59Z","timestamp":1183427039000},"page":"102-111","source":"Crossref","is-referenced-by-count":5,"title":["A Memetic Algorithm for Vertex-Biconnectivity Augmentation"],"prefix":"10.1007","author":[{"given":"Sandor","family":"Kersting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"4","key":"11_CR1","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(4):653\u2013665, 1976.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"11_CR2","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):270\u2013283, 1981.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"11_CR3","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(2):109\u2013122, 1986.","journal-title":"Combinatorica"},{"issue":"5","key":"11_CR4","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/0222056","volume":"22","author":"Tsan-Sheng Hsu","year":"1993","unstructured":"T.-S. Hsu and V. Ramachandran. On finding a minimum augmentation to biconnect a graph. SIAM Journal on Computing, pages 889\u2013912, 1993.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"11_CR5","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):214\u2013225, 1993.","journal-title":"Journal of Algorithms"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"I. Ljubi\u0107 and J. Kratica. A genetic algorithm for the biconnectivity augmentation problem. In C. Fonseca, J.-H. Kim, and A. Smith, editors, Proceedings of the 2000 IEEE Congress on Evolutionary Computation, pages 89\u201396. IEEE Press, 2000.","DOI":"10.1109\/CEC.2000.870280"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45365-2_3","volume-title":"Applications of Evolutionary Computation","author":"I. Ljubi\u0107","year":"2001","unstructured":"I. Ljubi\u0107 and G. R. Raidl. An evolutionary algorithm with hill-climbing for the edge-biconnectivity augmentation problem. In E. J. Boers, S. Cagnoni, J. Gottlieb, E. Hart, P. L. Lanzi, G. R. Raidl, R. E. Smith, and H. Tijink, editors, Applications of Evolutionary Computation, volume 2037 of LNCS, pages 20\u201329. Springer, 2001."},{"key":"11_CR8","unstructured":"P. Moscato. Memetic algorithms: A short introduction. In D. Corne et al., editors, New Ideas in Optimization, pages 219\u2013234. McGraw Hill, 1999."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"G. R. Raidl and I. Ljubi\u0107. Evolutionary local search for the edge-biconnectivity augmentation problem. to appear in Information Processing Letters, 2001.","DOI":"10.1016\/S0020-0190(01)00285-X"},{"key":"11_CR10","unstructured":"A. Zhu, S. Khuller, and B. Raghavachari. A uniform framework for approximating weighted connectivity problems. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 937\u2013938, 1999."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T03:33:25Z","timestamp":1737171205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}