This paper presents a new approach to model weighted graphs with correlated weights at the edges. Such models are important to describe many real world problems like routing in computer networks or finding shortest paths in traffic models under realistic assumptions. Edge weights are modeled by phase type distributions (PHDs), a versatile class of distributions based on continuous time Markov c...

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

Motivated by several search and optimization problems over uncertain datasets, we study the stochastic versions of a broad class of combinatorial problems where either the existences or the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest paths, minimum weight spanning trees, and minimum weight matchings over probabilistic graphs;...