Probabilistic models for the Steiner Tree problem

We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having its vertices associated with a probability of presence (independently each from another) in the second stage. A first-stage feasible solution on the input graph might become infeasible in the second stage, when certain vertices of the graph fail. Therefore, a well defined modification strategy is devised for modifying the remainders of a first-stage solution to render it secondstage feasible. The objective is to minimize the expected weight of the second-stage solution over the distribution of all possible second-stage materializable subgraphs of the input graph. We recognize two complementary computational problems in this setting, one being the a priori computation of first-stage decisions given a particular modification strategy, and the second being the cost-efficient modification of a first-stage feasible solution. We prove that both these problems are NP-hard for the Steiner Tree problem under this setting. We design and analyze probabilistically an efficient modification strategy, and derive tight approximation results for both aforementioned problems. We show that our techniques can be extended to the case of the more general Steiner Forest problem in the same probabilistic setting.

[1]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[2]  D. Bertsimas.  Probabilistic combinatorial optimization problems , 1988 .

[3]  Patrick Jaillet,et al.  Shortest path problems with node failures , 1992, Networks.

[4]  Vangelis Th. Paschos,et al.  A priori optimization for the probabilistic maximum independent set problem , 2002, Theor. Comput. Sci..

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[6]  R. Ravi,et al.  What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization , 2005, APPROX-RANDOM.

[7]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[8]  R. Ravi,et al.  An edge in time saves nine: LP rounding approximation algorithms for stochastic network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  R. Ravi,et al.  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..

[10]  Gerhard J. Woeginger,et al.  On the robust assignment problem under a fixed number of cost scenarios , 2006, Oper. Res. Lett..

[11]  Chaitanya Swamy,et al.  Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[12]  Chaitanya Swamy,et al.  Sampling-based approximation algorithms for multi-stage stochastic optimization , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[13]  R. Ravi,et al.  Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.

[14]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[15]  Vangelis Th. Paschos,et al.  The Probabilistic Minimum Vertex‐covering Problem , 2002 .

[16]  Roberto Montemanni,et al.  A branch and bound algorithm for the robust shortest path problem with interval data , 2004, Oper. Res. Lett..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Nicole Immorlica,et al.  On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.

[19]  Chaitanya Swamy,et al.  Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization , 2005, Algorithms for Optimization with Incomplete Information.

[20]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[21]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[22]  S. Hougardy,et al.  Approximation Algorithms for the Steiner Tree Problem in Graphs , 2001 .

[23]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Vangelis Th. Paschos,et al.  On the probabilistic minimum coloring and minimum k-coloring , 2006, Discret. Appl. Math..

[25]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[26]  R. Wets,et al.  Stochastic programming , 1989 .

[27]  Jochen Könemann,et al.  Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree , 2006, STOC '06.

[28]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

[29]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[30]  Mohit Singh,et al.  How to pay, come what may: approximation algorithms for demand-robust covering problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[31]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[32]  Vangelis Th. Paschos,et al.  The probabilistic longest path problem , 1999, Networks.

[33]  Dimitris Bertsimas,et al.  The probabilistic minimum spanning tree problem , 1990, Networks.