G.R. Raidl, et al.  Home/Search
Context
Related
| aragorn.ads.tuwien.ac.at...raidl02.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: aragorn.ads.tuwien.ac.at/publi... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge-biconnected. An application is the extension of an existing communication network to become robust against single link-failures. An evolutionary algorithm (EA) is presented which includes an e#ective preprocessing of the problem data and a local improvement procedure that is applied during initialization, recombination, and mutation. In this way, the EA... (Update)
Active bibliography (related documents): More All
0.7: A Hybrid GA for the Edge-Biconnectivity Augmentation Problem - Ljubic, Raidl, Kratica (2000) (Correct)
0.7: A Memetic Algorithm for Vertex-Biconnectivity Augmentation - Kersting, Raidl, Ljubic (Correct)
0.5: Case for support: An investigation of evolutionary scheduling - Part Previous Research (Correct)
Similar documents based on text: More All
0.4: Solving the Prize-Collecting Steiner Tree Problem - Lubic, al. (2004) (Correct)
0.4: Prüfer Numbers: A Poor Representation of Spanning.. - Gottlieb.. (2001) (Correct)
0.3: Importance Sampling with Hemispherical Particle Footprints - Hey, Werner (Correct)
BibTeX entry: (Update)
@misc{ raidl-evolutionary,
author = "G.R. Raidl and et al.",
title = "Evolutionary Local Search fir the Edge-Biconnectibity Augmentation Problem",
url = "citeseer.ist.psu.edu/548001.html" }
Citations (may not include all citations):2138 Genetic Algorithms in Search (context) - Goldberg - 1989
129 Handbook of Evolutionary Computation (context) - Back, Fogel et al. - 1997
36 Memetic algorithms: A short introduction (context) - Moscato - 1999
31 Approximation algorithms for several graph augmentation (context) - Frederickson, Jaja - 1981
26 Approximation algorithms for graph augmentation (context) - Khuller, Thurimella - 1993
22 Approximation algorithms for finding highly connected subgra.. - Khuller - 1996
22 Representing trees in genetic algorithms - Palmer, Kershenbaum - 1994
10 A new evolutionary approach to the degree constrained minimu.. - Knowles, Corne - 2000
9 cient algorithms for finding minimum spanning trees in undir.. (context) - Gabow, Galil et al. - 1986
7 fach kantenzusammenh angende Graphen (context) - Mader - 1971
6 An algorithm to eliminate all complex triangles in a maximal.. (context) - Tsukiyama, Kioke et al. - 1993
4 A uniform framework for approximating weighted connectivity .. - Zhu - 1999
4 A uniform framework for approximating weighted connectivity .. - Zhu, Khuller et al. - 1999
2 optimal Steiner trees in large graphs (context) - Esbensen, near- - 1995
1 A hybrid GA for the edge-biconnectivity augmentation problem - Ljubic, Raidl et al. - 2000
1 An evolutionary algorithm with stochastic hill-climbing for .. (context) - Ljubic, Raidl - 2001
Documents on the same site (http://aragorn.ads.tuwien.ac.at/publications/bib/pdf/): More
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees - Raidl, al. (Correct)
A Predecessor Coding in an Evolutionary Algorithm for the.. - Raidl, Drexel (Correct)
An Efficient Evolutionary Algorithm for the Degree-Constrained.. - Raidl (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC