2 citations · 3 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Online Bin Covering with Exact Parameter Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
We show an asymptotic 2/3-competitive strategy for the bin covering problem using O(b+log n) bits of advice, where b is the number of bits used to encode a rational value and n is…
cs.CG2023
Approximation Algorithms for the Two-Watchman Route in a Simple Polygon
Bengt J. Nilsson, Eli Packer
The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the…
cs.CG2023
Guarding Polyominoes Under -Hop Visibility
Omrit Filtser, Erik Krohn, Bengt J. Nilsson +2
We study the Art Gallery Problem under -hop visibility in polyominoes. In this visibility model, two unit squares of a polyomino can see each other if and only if the shortest p…