Polynomial time algorithms for 2-edge-connectivity augmentation problems

DOI10.1007/s00453-003-1024-7zbMath1045.68153OpenAlexW2122570469MaRDI QIDQ1402224

Guido Proietti, Anna Galluccio

Publication date: 19 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1024-7

zbMATH Keywords

Data structuresGraph algorithmsNetwork survivabilityAugmentation problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A faster computation of all the best swap edges of a shortest paths tree ⋮ Exact and approximate truthful mechanisms for the shortest paths tree problem ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality ⋮ A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation ⋮ Fault-tolerant approximate shortest-path trees ⋮ Improved algorithms for the multicut and multiflow problems in rooted trees

This page was built for publication: Polynomial time algorithms for 2-edge-connectivity augmentation problems