Publication:3128880
From MaRDI portal
zbMath0873.68005MaRDI QIDQ3128880
Éva Tardos, David B. Shmoys, David P. Williamson, Andrew V. Goldberg, Michel X. Goemans, Serge A. Plotkin
Publication date: 23 April 1997
90C35: Programming involving graphs or networks
68M10: Network design and communication in computer systems
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Connectivity-splitting models for survivable network design, Algorithms for a network design problem with crossing supermodular demands, Design of Survivable Networks: A survey, Approximating Steiner Networks with Node Weights, Upgrading bottleneck constrained forests, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, GMPLS label space minimization through hypergraph layouts, Linear bounds for on-line Steiner problems, An approximation algorithm for minimum-cost vertex-connectivity problems, Approximating fault-tolerant group-Steiner problems, New primal-dual algorithms for Steiner tree problems, A note on Rooted Survivable Networks, Approximating minimum-power edge-covers and 2,3-connectivity, Modifying edges of a network to obtain short subgraphs, An efficient approximation algorithm for the survivable network design problem, Algorithms for a multi-level network optimization problem, The parsimonious property of cut covering problems and its applications, Rounding algorithms for covering problems, On the approximability of some Maximum Spanning Tree Problems, Approximating covering integer programs with multiplicity constraints, Recent results on approximating the Steiner tree problem and its generalizations, On survivable network polyhedra, Approximating minimum size \{1,2\}-connected networks, A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, A primal-dual approximation algorithm for generalized Steiner network problems, Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment, Approximability of Capacitated Network Design, An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity, An O(logn)-Competitive Algorithm for Online Constrained Forest Problems, Network flow spanners, Designing Hypergraph Layouts to GMPLS Routing Strategies, Approximation algorithm for the group Steiner network problem
