scientific article; zbMATH DE number 1263260
From MaRDI portal
Publication:4234132
zbMath0923.90136MaRDI QIDQ4234132
Harold N. Gabow, Michel X. Goemans, David P. Williamson
Publication date: 28 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmconnectivitysurvivable network designminimum-cost subgraphminimum odd cutspriority queue system
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items
A data structure for bicategories, with application to speeding up an approximation algorithm, 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, Rounding algorithms for covering problems, Minimizing symmetric submodular functions, An efficient approximation algorithm for the survivable network design problem, On budget-constrained flow improvement.
