Elementary shortest-paths visiting a given set of nodes


Consider a directed graph G = (V,A) with set of nodes V and set of arcs A and let cuv denote the length of an arc uv ∈ A. Given two distinguished nodes s and t of V we are interested in the problem of determining a shortest-path (in length) from s to t in G that must visit only once all nodes of a given set P ⊆ V −{s, t}, but not necessarily only these… (More)


1 Figure or Table

Slides referencing similar topics