On the Parameterized Complexity of the Maximum Exposure Problem

Abstract

We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space ( , ) where is the set of ranges containing a set of points, and an integer , MEP asks for ranges which on removal results in the maximum number of exposed points. A point is said to be exposed when is not contained in any of the ranges in . The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.