DeepAI AI Chat
Log In Sign Up

On the Parameterized Complexity of the Maximum Exposure Problem

by   Remi Raman, et al.

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.


page 1

page 2

page 3

page 4


The Maximum Exposure Problem

Given a set of points P and axis-aligned rectangles ℛ in the plane, a po...

On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-p...

The Longest Run Subsequence Problem: Further Complexity Results

Longest Run Subsequence is a problem introduced recently in the context ...

Grid Recognition: Classical and Parameterized Computational Perspectives

Grid graphs, and, more generally, k× r grid graphs, form one of the most...

Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution

In this work, I present an optimization problem which consists of assign...

Overview of the Evaluation Methods for the Maximum EMF Exposure in 5G Networks

Instantaneous measurements of the electromagnetic field (EMF) strength d...

Facility location under matroid constraints: fixed-parameter algorithms and applications

We study an NP-hard uncapacitated discrete facility location problem: Th...