On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Provisioning a virtual private network: a network design problem for multicommodity flow
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
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial 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
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for 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
Approximating a Finite Metric by a Small Number of Tree Metrics
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
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
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
Approximation to the minimum cost edge installation problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
On the approximation of the generalized capacitated tree-routing problem
Journal of Discrete Algorithms
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
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
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
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 |
In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large cables by economies of scale. The problem is to install cables on edges at minimum cost, such that the flow from each source to the sink can be routed simultaneously. The approximation ratio of this NP-hard problem was gradually reduced from O(log2n) to 65.49 by a long series of papers. In this paper, we design a better 24.92 approximation algorithm for this problem.