A primal–dual schema based approximation algorithm for the element connectivity problem

DOI10.1016/S0196-6774(02)00222-5MaRDI QIDQ4806590zbMATH OpenOpenAlexFDO

Authors

Publication date 14 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(02)00222-5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1305440
• Publication:4886063
• An approximation algorithm for minimum-cost vertex-connectivity problems
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems

Cited in

(6)

• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Network design via iterative rounding of setpair relaxations
• On element-connectivity preserving graph simplification
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• Approximating a class of combinatorial problems with rational objective function

This page was built for publication: A primal–dual schema based approximation algorithm for the element connectivity problem

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