by I. Ljubić, G. R. Raidl
Reference:
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of GraphsI. Ljubić, G. R. RaidlJournal of Heuristics, volume 9, pages 401–427, 2003, Kluwer Academic Publishers.Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf
Bibtex Entry:
@ARTICLE{ljubic-02,
author = {I. Ljubić and G. R. Raidl},
title = {A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs},
journal = {Journal of Heuristics},
year = 2003,
volume = 9,
pages = {401--427},
publisher = {Kluwer Academic Publishers},
note = {previous technical report version at \url{https://www.ac.tuwien.ac.at/files/pub/ljubic-02.pdf}},
keywords = {evolcomp,netdesign,hybrid},
}