Publication:4234132
From MaRDI portal
zbMath0923.90136MaRDI QIDQ4234132
Harold N. Gabow, David P. Williamson, Michel X. Goemans
Publication date: 28 October 1999
approximation algorithm; connectivity; survivable network design; minimum-cost subgraph; minimum odd cuts; priority queue system
90C35: Programming involving graphs or networks
90C10: Integer programming
90C60: Abstract computational complexity for mathematical programming problems
90B10: Deterministic network models in operations research
Related Items
Minimizing symmetric submodular functions, An efficient approximation algorithm for the survivable network design problem, A data structure for bicategories, with application to speeding up an approximation algorithm, Rounding algorithms for covering problems, Approximating minimum-cost graph problems with spanning tree edges, A primal-dual approximation algorithm for generalized Steiner network problems, Minimizing submodular functions over families of sets, On budget-constrained flow improvement.