{"version":"1.0","type":"link","title":"Watchman route problem - Newikis","description":"The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take to guard an entire area with obstacles given only a map of the area. The challenge is to make sure the watchman peeks behind every corner and to…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}