Xuehou Tan A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. 92-103 2007 384 Theor. Comput. Sci. 1 http://dx.doi.org/10.1016/j.tcs.2007.05.021 db/journals/tcs/tcs384.html#Tan07