scientific article; zbMATH DE number 2119765

MaRDI QIDQ4829040zbMATH OpenFDO

Authors R. Ravi, David P. Williamson

Publication date 29 November 2004

zbMATH Keywords

survivable network design problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
• Improved Approximation Algorithms for Uniform Connectivity Problems
• Publication:4886063
• Approximation Algorithms for Graph Augmentation
• An approximation algorithm for minimum-cost vertex-connectivity problems

Cited in

(5)

• Erratum to ``Minimum cost flows with minimum quantities
• Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances
• Erratum: ``Approximating minimum-cost connectivity problems via uncrossable bifamilies

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 Q4829040)