The Maximum Exposure Problem

02/06/2021
by   Neeraj Kumar, et al.
0

Given a set of points P and axis-aligned rectangles ℛ in the plane, a point p ∈ P is called exposed if it lies outside all rectangles in ℛ. In the max-exposure problem, given an integer parameter k, we want to delete k rectangles from ℛ so as to maximize the number of exposed points. We show that the problem is NP-hard and assuming plausible complexity conjectures is also hard to approximate even when rectangles in ℛ are translates of two fixed rectangles. However, if ℛ only consists of translates of a single rectangle, we present a polynomial-time approximation scheme. For range space defined by general rectangles, we present a simple O(k) bicriteria approximation algorithm; that is by deleting O(k^2) rectangles, we can expose at least Ω(1/k) of the optimal number of points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2022

On the Parameterized Complexity of the Maximum Exposure Problem

We investigate the parameterized complexity of Maximum Exposure Problem ...
research
09/26/2022

Improved and Generalized Algorithms for Burning a Planar Point Set

Given a set P of points in the plane, a point burning process is a discr...
research
09/01/2023

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem

Sublinear time complexity is required by the massively parallel computat...
research
07/14/2021

A QPTAS for stabbing rectangles

We consider the following geometric optimization problem: Given n axis-a...
research
12/08/2017

On the Longest Spanning Tree with Neighborhoods

We study a maximization problem for geometric network design. Given a se...
research
02/22/2022

The near exact bin covering problem

We present a new generalization of the bin covering problem that is know...
research
02/19/2020

Optimally Guarding Perimeters and Regions with Mobile Range Sensors

We investigate the problem of using mobile robots equipped with 2D range...

Please sign up or login with your details

Forgot password? Click here to reset