On the Parameterized Complexity of the Maximum Exposure Problem

Abstract

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 number of exposed points. A point p is said to be exposed when p is not contained in any of the ranges inR. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.