Fastest known algorithm for finding simple paths through given set of vertices For an undirected graph $G$ and a given set $S$ of vertices, what is the asymptotically fastest known algorithm for finding a simple path containing
all elements of $S$. What if we require the path to be as short as possible ?
See http://thorehusfeldt.files.wordpress.com/2010/08/soda2012_submission_247.pdf.