Abstract
We study a probabilistic model for graph-problems under vertex-uncertainty. We assume that any vertex v i of the input-graph G has only a probability p i 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, where V is the vertex-set of G; 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Murat, C., Paschos, V.T.: On the probabilistic minimum coloring and minimum k-coloring. Discrete Appl. Math. 154, 564–586 (2006)
Murat, C., Paschos, V.T.: Probabilistic combinatorial optimization on graphs. ISTE and Hermès Science Publishing, London (2006)
Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38, 1019–1033 (1990)
Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41, 973–989 (1994)
Bertsimas, D.J.: Probabilistic combinatorial optimization problems. Phd thesis, Operations Research Center. MIT, Cambridge Mass., USA (1988)
Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci. 3, 184–191 (1989)
Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks 20, 245–275 (1990)
Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center. MIT, Cambridge Mass., USA (1985)
Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36, 929–936 (1988)
Jaillet, P.: Shortest path problems with node failures. Networks 22, 589–605 (1992)
Jaillet, P., Odoni, A.: The probabilistic vehicle routing problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle routing: methods and studies. North Holland, Amsterdam (1988)
Bianchi, L., Knowles, J., Bowler, N.: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. European J. Oper. Res. 161, 206–219 (2005)
Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl Res. 9, 19–32 (2002), Preliminary version, http://www.lamsade.dauphine.fr/~paschos/documents/c170.pdf
Bourgeois, N., Della Croce, F., Escoffier, B., Murat, C., Paschos, V.T.: Probabilistic coloring of bipartite and split graphs. J. Comb. Optimization (to appear)
Murat, C., Paschos, V.T.: The probabilistic longest path problem. Networks 33, 207–219 (1999)
Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci. 270, 561–590 (2002), http://www.lamsade.dauphine.fr/~paschos/documents/c166.pdf
Paschos, V.T., Telelis, O.A., Zissimopoulos, V.: Steiner forests on stochastic metric graphs. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 112–123. Springer, Heidelberg (2007)
Bellalouna, M., Murat, C., Paschos, V.T.: Probabilistic combinatorial optimization problems: a new domain in operational research. European J. Oper. Res. 87, 693–706 (1995)
Murat, C., Paschos, V.T.: L’optimisation combinatoire probabiliste. In: Paschos, V.T. (ed.) Optimisation combinatoire : concepts avancés, pp. 221–247. Hermès Science, Paris (2005)
Murat, C., Paschos, V.T.: What about future? Robustness under vertex-uncertainty in graph-problems. Cahier du LAMSADE 236, LAMSADE, Université Paris-Dauphine (2006), http://www.lamsade.dauphine.fr/~paschos/documents/pcopclassifcah.pdf
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. In: Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murat, C., Paschos, V.T. (2008). Vertex-Uncertainty in Graph-Problems. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)