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.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.