Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGACT News
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh 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
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
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth 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
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
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
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Journal of Discrete Algorithms
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
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
Competitive cost sharing with economies of scale
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the approximation of the generalized capacitated tree-routing problem
Journal of Discrete Algorithms
Routing and scheduling for energy and delay minimization in the powerdown model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximation algorithms for grooming in optical network design
Theoretical Computer Science
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
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Traffic-redundancy aware network design
Proceedings of the twenty-third 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
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
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
A note on the subadditive network design problem
Operations Research Letters
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Energy-Efficient network routing with discrete cost functions
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
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 essence of the simplest buy-at-bulk network design problem is buying network capacity "wholesale" to guarantee connectivity from all network nodes to a certain central network switch. Capacity is sold with "volume discount": the more capacity is bought, the cheaper is the price per unit of bandwidth. We provide O(log/sup 2/n) randomized approximation algorithm for the problem. This solves the open problem in Salman et al. (1997). The only previously known solutions were restricted to special cases (Euclidean graphs). We solve additional natural variations of the problem, such as multi-sink network design, as well as selective network design. These problems can be viewed as generalizations of the the Generalized Steiner Connectivity and Prize-collecting salesman (K-MST) problems. In the selective network design problem, some subset of /spl kappa/ wells must be connected to the (single) refinery, so that the total cost is minimized.