Heuristics with constant error guarantees for the design of tree networks
Management Science
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
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Telecommunications Network Planning
Telecommunications Network Planning
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
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
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
| Hi-index | 0.00 |
We study a network loading problem with applications in local access network design. Given a network, the problem is to route flow from several sources to a sink and to install capacity on the edges to support flows at minimum cost. Capacity can be purchased only in multiples of a fixed quantity. All the flow from a source must be routed in a single path to the sink. This NP-hard problem generalizes the Steiner tree problem and also more effectively models the applications traditionally formulated as capacitated tree problems. We present an approximation algorithm with performance ratio (ρST +2) where ρST is the performance ratio of any approximation algorithm for minimum Steiner tree. When all sources have the same demand value, the ratio improves to (ρST +1) and in particular, to 2 when all nodes in the graph are sources.