A primal–dual schema based approximation algorithm for the element connectivity problem
From MaRDI portal
Publication:4806590
DOI10.1016/S0196-6774(02)00222-5zbMath1122.90351OpenAlexW1975905867MaRDI QIDQ4806590
No author found.
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
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items
Approximating a class of combinatorial problems with rational objective function ⋮ Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems