Zobrazeno 1 - 1
of 1
pro vyhledávání: '"S, Shahin John J"'
We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the maximum numbe
Externí odkaz:
http://arxiv.org/abs/2203.11114