On the Parameterized Complexity of the Maximum Exposure Problem
Remi Raman, Shahin John J S, R Subashini, Subhasree Methirumangalath
TL;DR
This paper studies the parameterized complexity of the NP-hard Maximum Exposure Problem, providing fixed-parameter tractable results for various parameterizations to better understand its computational aspects.
Contribution
It introduces fixed-parameter tractable algorithms for MEP under different parameterizations, advancing the understanding of its computational complexity.
Findings
Fixed-parameter tractability results for MEP
Analysis of MEP's complexity with respect to various parameters
Enhanced understanding of MEP's computational boundaries
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 in R. The problem is known to be NP-hard. In this letter, we give fixed-parameter tractable results of MEP with respect to different parameterizations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Constraint Satisfaction and Optimization