A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

Journal of Heuristics

Volumn 9, Issue 5, 2003, Pages 401-427

  Ljubić, Ivana ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Connectivity augmentation; Evolutionary computation; Memetic algorithm; Network survivability; Vertex biconnectivity

Indexed keywords

COMPUTER NETWORKS; COSTS; DATA PROCESSING; DATA STRUCTURES; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; SET THEORY;

CONNECTIVITY AUGMENTATION; MEMETIC ALGORITHMS; VERTEX-BICONNECTIVITY;

GRAPH THEORY;

EID: 0348220849     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000004810.27436.30     Document Type: Article

References (32)

1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman. (1983). Data Structures and Algorithms. Reading, MA: Addison-Wesley.
2. Blickle, T. (1997). "Tournament Selection." In T. Bäck, D.B. Fogel, and Z. Michalewicz (eds.), Handbook of Evolutionary Computation, New York: Oxford University Press, pp. C2.3:1-C2.3:4.
3. Cheriyan, J., S. Vempala, and A. Vetta. (2002). "An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph." Proceedings of the 34th ACM Symposium on the Theory of Computing, pp. 306-312.
4. Eswaran, K.P. and R.E. Tarjan. (1976). "Augmentation Problems. " SIAM Journal on Computing 5(4), 653-665.
5. Fialgo, S. and P. Mutzel. (1998). "A New Approximation Algorithm for the Planar Augmentation Problem." In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM.
6. Fonseca, C., J.-H. Kim, and A. Smith (eds.) (2000). In Proceedings of the 2000 IEEE Congress on Evolutionary Computation. IEEE Press.
7. Fortz, B. (2000). Design of Survivable Networks with Bounded Rings. Network Theory and Applications. Universitè Libre de Bruxelles, Bruxelles, Belgium: Kluwer Academic Publishers.
8. Frederickson, G.N. and J. Jájá. (1981). "Approximation Algorithms for Several Graph Augmentation Problems." SIAM Journal on Computing 10(2), 270-283.
9. Frederickson, G.N. and J. Jájá. (1982). "On the Relationship Between the Biconnectivity Augmentation and Traveling Salesman Problems." Theoretical Computer Science 19(2), 203-218.
10. Gabow, H.N., Z. Galil, T. Spencer, et al. (1986). "Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs." Combinatorica 6(2), 109-122.
11. Hsu, T.-S. and V. Ramachandran (1993). "Finding a Smallest Augmentation to Biconnect a Graph." SIAM Journal on Computing 22(5), 889-912.
12. Ishii, T. (2000). "Studies on Multigraph Connectivity Augmentation Problems." Ph.D. Thesis, Dept. of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan.
13. Jones, J. and S. Forrest (1995). "Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms." In L.J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann, pp. 184-192.
14. Kersting, S., G.R. Raidi, and I. Ljubić (2002). "A Memetic Algorithm for Vertex-Biconnectivity Augmentation." In S. Cagnoni, J. Gottlieb, E. Hart, et al. (eds.), Applications of Evolutionary Computing: EvoWorkshops 2002. Springer, vol. 2279 of LNCS, pp. 102-111.
15. Khuller, S. (1997). "Approximation Algorithms for Finding Highly Connected Subgraphs." In D.S. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems, Boston, MA: PWS, pp. 236-265.
16. Khuller, S. and R. Thurimella. (1993). "Approximation Algorithms for Graph Augmentation." Journal of Algorithms 14(2), 214-225.
17. Ljubić, I. and J. Kratica. (2000). "A Genetic Algorithm for the Biconnectivity Augmentation Problem." In Fonseca et al. (2000), 89-96.
18. Ljubić, I. and G.R. Raidl. (2001). "An Evolutionary Algorithm with Hill-Climbing for the Edge-Biconnectivity Augmentation Problem." In E.J.W. Boers, S. Cagnoni, J. Gottlieb, et al. (eds.), Applications of Evolutionary Computing: EvoWorkshops 2001. Springer, vol. 2037 of LNCS, pp. 20-29.
19. Merz, P. (2000). "Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies." Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany.
20. Merz, P. and B. Freisleben (1999). "Fitness Landscapes and Memetic Algorithm Design." In New Ideas in Optimisation, Berkshire, England: McGraw-Hill, pp. 245-260.
21. Merz, P. and B. Freisleben. (2000). "Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem." IEEE Transactions on Evolutionary Computation 4(4), 337-352.
22. Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer.
23. Monma, C.L. and D.F. Shallcross. (1989). "Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints." Operations Research 37(4), 531-541.
24. Moscato, P. (1999). "Memetic Algorithms: A Short Introduction. " In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, Berkshire, England: McGraw Hill, pp. 219-234.
25. Raidl, G.R. (2000). "An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem." In Fonseca et al. (2000), 104-111.
26. Raidl, G.R. and J. Gottlieb (1999). "On the Importance of Phenotypic Duplicate Elimination in Decoder-Based Evolutionary Algorithms. " In S. Brave and A.S. Wu (eds.), Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference. Orlando, FL, pp. 204-211.
27. Raidl, G.R. and I. Ljubić (2002). "Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem." Information Processing Letters 82(1), 39-45.
28. Stoer, M. (1992). Design of Survivable Networks, vol. 1531 of Lecture Notes in Mathematics. Springer.
29. Tarjan, R.E. (1972). "Depth First Search and Linear Graph Algorithms." SIAM Journal of Computing 1, 146-160.
30. Watanabe, T. and A. Nakamura. (1987). "Edge-Connectivity Augmentation Problems." Journal of Computer and System Sciences 35(1), 96-144.
31. Zhu, A. (1999). "A Uniform Framework for Approximating Weighted Connectivity Problems." B.Sc. thesis at the University of Maryland, MD.
32. Zhu, A., S. Khuller, and B. Raghavachari (1999). "A Uniform Framework for Approximating Weighted Connectivity Problems." In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 937-938.