Maarouf, Amina
(Lebanese American University, 2011-10-24)
Given a Euclidean graph G = (Y, E) with a special set of vertices, called the terminal s, the Euclidean Steiner Walk problem asks for a walk through the vertices
of the graph that starts and ends at a particular point, ...