Evolutionary local search for the edge-biconnectivity augmentation problem

DOI10.1016/S0020-0190(01)00285-XzbMath1013.68070WikidataQ62048309 ScholiaQ62048309MaRDI QIDQ1603576

Ivana Ljubić, Günther R. Raidl

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemsinterconnection networksgraph algorithmsevolutionary algorithmsconnectivity augmentation problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation

Cites Work

• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Approximation Algorithms for Several Graph Augmentation Problems
• Approximation Algorithms for Graph Augmentation
• Augmentation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evolutionary local search for the edge-biconnectivity augmentation problem