|
Description: |
A path in a graph is a sequence of vertices linked by graph edges. The determination of an optimal path with respect to a given objective function has led to classical network optimization problems. However, for many applications, it is useful to know an alternative backup solution,which can replace the optimal path if needed and, in some cases, which is reasonably diverse (or "different") from the latter. In this talk we will discuss applications which justify finding diverse paths, approaches that have been used to model and solve such problems, as well as open questions within this line of research.
|
