{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:26:32Z","timestamp":1747653992393},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0020-0190(01)00285-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"39-45","source":"Crossref","is-referenced-by-count":6,"title":["Evolutionary local search for the edge-biconnectivity augmentation problem"],"prefix":"10.1016","volume":"82","author":[{"given":"G\u00fcnther R.","family":"Raidl","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00285-X_BIB001","series-title":"Handbook of Evolutionary Computation","author":"B\u00e4ck","year":"1997"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB002","series-title":"Proceedings of the 6th International Conference on Genetic Algorithms","first-page":"485","article-title":"Finding (near-)optimal Steiner trees in large graphs","author":"Esbensen","year":"1995"},{"issue":"4","key":"10.1016\/S0020-0190(01)00285-X_BIB003","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(01)00285-X_BIB004","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","article-title":"Approximation algorithms for several graph augmentation problems","volume":"10","author":"Frederickson","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(01)00285-X_BIB005","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB006","series-title":"Genetic Algorithms in Search, Optimization, and Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB007","series-title":"Approximation Algorithms for NP-hard Problems","first-page":"236","article-title":"Approximation algorithms for finding highly connected subgraphs","author":"Khuller","year":"1996"},{"issue":"2","key":"10.1016\/S0020-0190(01)00285-X_BIB008","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/jagm.1993.1010","article-title":"Approximation algorithms for graph augmentation","volume":"14","author":"Khuller","year":"1993","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0020-0190(01)00285-X_BIB009","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/4235.850653","article-title":"A new evolutionary approach to the degree constrained minimum spanning tree problem","volume":"4","author":"Knowles","year":"2000","journal-title":"IEEE Trans. Evolutionary Comput."},{"key":"10.1016\/S0020-0190(01)00285-X_BIB010","series-title":"Applications of Evolutionary Computation","first-page":"20","article-title":"An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem","volume":"2037","author":"Ljubi\u0107","year":"2001"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB011","series-title":"Proceedings of the 2000 Parallel Problem Solving from Nature VI Conference","first-page":"641","article-title":"A hybrid GA for the edge-biconnectivity augmentation problem","volume":"1917","author":"Ljubi\u0107","year":"2000"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB012","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","article-title":"Minimale n-fach kantenzusammenh\u00e4ngende Graphen","volume":"191","author":"Mader","year":"1971","journal-title":"Math. Ann."},{"key":"10.1016\/S0020-0190(01)00285-X_BIB013","series-title":"New Ideas in Optimization","first-page":"219","article-title":"Memetic algorithms: A short introduction","author":"Moscato","year":"1999"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB014","series-title":"Proceedings of the First IEEE Conference on Evolutionary Computation","first-page":"379","article-title":"Representing trees in genetic algorithms","author":"Palmer","year":"1994"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB015","series-title":"Algorithmic Aspects of VLSI Layout","article-title":"An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floorplanning","author":"Tsukiyama","year":"1993"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB016","series-title":"A uniform framework for approximating weighted connectivity problems, B.Sc. Thesis","author":"Zhu","year":"1999"},{"key":"10.1016\/S0020-0190(01)00285-X_BIB017","series-title":"Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms","first-page":"937","article-title":"A uniform framework for approximating weighted connectivity problems","author":"Zhu","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100285X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100285X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:52:57Z","timestamp":1556481177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900100285X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S002001900100285X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00285-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}