Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximation algorithms
Optical networks: a practical perspective
Optical networks: a practical perspective
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Hardness of Buy-at-Bulk Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Survivability and Traffic Grooming in WDM Optical Networks
Survivability and Traffic Grooming in WDM Optical Networks
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing
A Constant Factor Approximation for the Single Sink Edge Installation Problem
SIAM Journal on Computing
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
| Hi-index | 0.00 |
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against a single edge or node failure in the network. In practice, the most popular model used in high-speed telecommunication networks for protection against failures is the so-called 1 + 1 model. In this model, two-edge or node-disjoint paths are provisioned for each demand pair. We obtain the first nontrivial approximation algorithms for buy-at-bulk network design in the 1 + 1 model for both edge and node-disjoint protection requirements. Our results are for the single-cable cost model, which is prevalent in optical networks. More specifically, we present a constant-factor approximation for the single-sink case and a polylogarithmic factor approximation for the multicommodity case. These results are of interest for practical applications and also suggest several new challenging theoretical problems.