New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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 constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for a capacitated network design problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The Access Network Design Problem
FOCS '98 Proceedings of the 39th 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
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Linear programming and capacitated network loading
Linear programming and capacitated network loading
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
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
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Journal of Discrete Algorithms
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the Complexity of the Asymmetric VPN Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Approximation algorithms for single and multi-commodity connected facility location
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
Traffic-redundancy aware network design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
The buy-at-bulk network design problem is to design a minimum cost network to satisfy some flow demands, by installing cables from an available set of cables with different costs per unit length and capacities, where the cable costs obey economies of scale. For the single-sink buy-at-bulk problem, [10] gave the first constant factor approximation. In this paper, we use techniques of [9] to get an improved constant factor approximation. This also shows that the integrality gap of a natural linear programming formulation is a constant, thus answering the open question in [9].