A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Improved approximation algorithms for uniform connectivity problems
Journal of Algorithms
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of Approximation for Vertex-Connectivity Network Design Problems
SIAM Journal on Computing
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Survivable network design with degree or order constraints
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Additive guarantees for degree bounded directed network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Nearly Tight Low Stretch Spanning Trees
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for Single-Source Vertex Connectivity
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Degree Bounded Network Design with Metric Costs
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Inferring social networks from outbreaks
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
An O(log n)-competitive algorithm for online constrained forest problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
Consider the edge-connectivity survivable network design problem: given a graph G = (V,E) with edge-costs, and edge-connectivity requirements rij for every pair of vertices i,j, find an (approximately) minimum-cost network that provides the required connectivity. While this problem is known to admit good approximation algorithms in the offline case, no algorithms were known for this problem in the online setting. In this paper, we give a randomized O(rmax log3 n) competitive online algorithm for this edge-connectivity network design problem, where rmax = maxij rij. Our algorithms use the standard embeddings of graphs into random subtrees (i.e., into singly connected subgraphs) as an intermediate step to get algorithms for higher connectivity. Our results for the online problem give us approximation algorithms that admit strict cost-shares with the same strictness value. This, in turn, implies approximation algorithms for (a) the rent-or-buy version and (b) the (two-stage) stochastic version of the edge-connected network design problem with independent arrivals. For these two problems, if we are in the case when the underlying graph is complete and the edge-costs are metric (i.e., satisfy the triangle inequality), we improve our results to give O(1)-strict cost shares, which gives constant-factor rent-or-buy and stochastic algorithms for these instances.