Designing least-cost nonblocking broadband networks
Journal of Algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
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
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
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)
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics
New Approaches for Virtual Private Network Design
SIAM Journal on Computing
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
A Constant Factor Approximation for the Single Sink Edge Installation Problem
SIAM Journal on Computing
A constant approximation algorithm for the a priori traveling salesman problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Stochastic steiner trees without a root
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A short proof of the VPN Tree Routing Conjecture on ring networks
Operations Research Letters
Design of trees in the hose model: The balanced case
Operations Research Letters
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
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
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Journal of the ACM (JACM)
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
Journal of Combinatorial Optimization
Hi-index | 0.02 |
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nodes to a random subset of them. In a recent work [Eisenbrand, Grandoni, Rothvoß, Schäfer-SODA'08], a new technique, core-detouring, is described to bound the mentioned connection cost. This is achieved by defining a sub-optimal connection scheme, where paths are detoured through a proper connected subgraph (core). The cost of the detoured paths is bounded against the cost of the core and of the distances from the sources to the core. The analysis then boils down to proving the existence of a convenient core. For some problems, such as connected facility location and single-sink rent-or-buy, the choice of the core is obvious (i.e., the Steiner tree in the optimum solution). Other, more complex network design problems do not exhibit any such core. In this paper we show that core-detouring can be nonetheless successfully applied. The basic idea is constructing a convenient core by manipulating the optimal solution in a proper (not necessarily trivial) way. We illustrate that by presenting improved approximation algorithms for two well-studied problems: virtual private network design and single-sink buy-at-bulk.