scientific article; zbMATH DE number 2079893

MaRDI QIDQ4472033zbMATH OpenFDO

Authors Sandor Kersting, Günther R. Raidl, Ivana Ljubić

Publication date 3 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2279/22790102.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Evolutionary local search for the edge-biconnectivity augmentation problem
• scientific article; zbMATH DE number 1703848
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
• Approximation Algorithms for Graph Augmentation

Cited in

(2)

• Evolutionary local search for the edge-biconnectivity augmentation problem
• scientific article; zbMATH DE number 1703848 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472033)