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
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Approximation algorithms for a capacitated network design problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Spanners and message distribution in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximating capacitated tree-routings in networks
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Approximation to the minimum cost edge installation problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximating capacitated tree-routings in networks
Journal of Combinatorial Optimization
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
| Hi-index | 0.00 |
This paper considers the problem of designing a minimum cost network meeting a given set of traffic requirements between n sites, using one type of channels of a given capacity, with varying set-up costs for different vertex pairs (comprised of a fixed part plus a part dependent on the pair). An approximation algorithm is proposed for this problem, which guaranteed a solution whose cost is greater than the optimum by a factor of at most log n (and constant in the planar case). The algorithm is based on an application of the recent construction of light-weight distance-preserving spanners.