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
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Traffic-redundancy aware network design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximations for buy-at-bulk and shallow-light k-steiner trees and (k,2)-subgraph
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We present the Cost-Distance problem: finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known $O(\log k)$ randomized approximation scheme for Cost-Distance, where $k$ is the number of sources. We reduce several common network design problems to Cost-Distance, obtaining (in some cases) the first known logarithmic approximation for them. These problems include single-sink buy-at-bulk with variable pipe types between different sets of nodes, facility location with buy-at-bulk-type costs on edges (integrated logistics), constructing single-source multicast trees with good cost and delay properties, priority Steiner trees, and multilevel facility location. Our algorithm is also easier to implement and significantly faster than previously known algorithms for buy-at-bulk design problems.