Probabilistic optimization in graph-problems

Authors

  • Cécile Murat LAMSADE, Université Paris-Dauphine
  • Vangelis Th. Paschos LAMSADE, Université Paris-Dauphine

Keywords:

graph problem, complexity, approximation,

Abstract

We study a probabilistic optimization model for graph-problems under vertex-uncertainty. We assume that any vertex vi of the input-graph G(V,E) has only a probability pi to be present in the final graph to be optimized (i.e., the final instance for the problem tackled will be only a sub-graph of the initial graph). Under this model, the original "deterministic" problem gives rise to a new (deterministic) problem on the same input-graph G, having the same set of feasible solutions as the former one, but its objective function can be very different from the original one, the set of its optimal solutions too. Moreover, this objective function is a sum of 2|V| terms; hence, its computation is not immediately polynomial. We give sufficient conditions for large classes of graph-problems under which objective functions of the probabilistic counterparts are polynomially computable and optimal solutions are well-characterized. Finally, we apply these general results to natural and well-known combinatorial problems that belong to the classes considered.

Downloads

Published

2010-04-14

How to Cite

Murat, C., & Paschos, V. T. (2010). Probabilistic optimization in graph-problems. Algorithmic Operations Research, 5(1), Pages 49 – 64. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/11267

Issue

Vol. 5 No. 1 (2010)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.