The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Robust Combinatorial Optimization with Exponential Scenarios
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An s-t connection problem with adaptability
Discrete Applied Mathematics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Optimization over integers with robustness in cost and few constraints
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Thrifty algorithms for multistage robust optimization
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
We study two-stage robustvariants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization problems, previously studied by Dhamdhere et al. [1], Golovin et al. [6], and Feige et al. [4], are two-stage planning problems in which the requirements are revealed after some decisions are taken in stage one. One has to then complete the solution, at a higher cost, to meet the given requirements. In the robust Steiner tree problem, for example, one buys some edges in stage one after which some terminals are revealed. In the second stage, one has to buy more edges, at a higher cost, to complete the stage one solution to build a Steiner tree on these terminals. The objective is to minimize the total cost under the worst-case scenario. In this paper, we focus on the case of exponentially manyscenarios given implicitly. A scenario consists of any subset of kterminals (for Steiner tree), or any subset of kterminal-pairs (for Steiner forest), or any subset of kclients (for facility location). We present the first constant-factor approximation algorithms for the robust Steiner tree and robust uncapacitated facility location problems. For the robust Steiner forest problem with uniform inflation, we present an O(logn)-approximation and show that the problem with two inflation factors is impossible to approximate within O(log1/2 茂戮驴 茂戮驴n) factor, for any constant 茂戮驴 0, unless NP has randomized quasi-polynomial time algorithms. Finally, we show APX-hardness of the robust min-cut problem (even with singleton-set scenarios), resolving an open question by [1] and [6].