2 citations · 3 across the 9 of their papers we have counts for
4 papers · 1 filter
APX-Hardness of the Minimum Vision Points Problem
Mayank Chaturvedi, Bengt J. Nilsson
Placing a minimum number of guards on a given watchman route in a polygonal domain is called the {\em minimum vision points problem}. We prove that finding the minimum number of vi…
Opposing Half Guards
Erik Krohn, Bengt J. Nilsson, Christiane Schmidt
We study the art gallery problem for opposing half guards: guards that can either see to their left or to their right only. We present art gallery theorems, show that the location…
Online Two-Dimensional Vector Packing with Advice
Bengt J. Nilsson, Gordana Vujovic
We consider the online two-dimensional vector packing problem, showing a lower bound of on the competitive ratio of any {\sc AnyFit} strategy for the problem. We provide str…
-Transmitter Watchman Routes
Bengt J. Nilsson, Christiane Schmidt
We consider the watchman route problem for a -transmitter watchman: standing at point in a polygon , the watchman can see if intersects 's bou…