Walking Through Waypoints

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid

We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ t…