On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buy-at-bulk network design: approximating the single-sink edge installation problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Constant-Factor Approximation Algorithm for the Multicommodity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Designing Networks Incrementally
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Hardness of Buy-at-Bulk Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
System level design paradigms: Platform-based design and communication synthesis
Proceedings of the 41st annual Design Automation Conference
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic Steiner Tree with Non-uniform Inflation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximating directed buy-at-bulk network design
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Approximating some network design problems with node costs
Theoretical Computer Science
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We study the multicommodity buy-at-bulk network design problem in which we seek to design a network that satisfies the demands between terminals from a given set of source-sink pairs. The key characteristic of this problem is the fact that the cost functions associated with the edges of the graph are sub-additive monotone and hence experience economies of scale. In the non-uniform case, each edge has its own cost function -- possibly different from other edges. Special cases of this problem have been studied extensively: there are approximation algorithms when the edge cost functions are identical or when all source-sink pairs share the same source. We present the first non-trivial approximation algorithm for the general case. Our algorithm is an extremely simple randomized greedy algorithm and has an approximation guarantee of exp(O√ln n ln ln n)) when the instance has at most n source-sink pairs with unit demands. In the case of general demands, this yields an approximation factor of exp(O √ln N ln ln N)), where N is the sum of all demands.