# A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem

Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem (REP) is defined as follows: For n axis-aligned rectangles inside an axis-aligned bounding box B, extend each rectangle in only one of the four directions: up, down, left, or right until it reaches B and the density k is minimized, where k is the maximum number of extensions of rectangles to the boundary that pass through a point inside bounding box B. REP is NP-hard for k>1. If the rectangles are points of a grid (or unit squares of a grid), the problem is called the square escape problem (SEP) and it is still NP-hard. We give a 2-approximation algorithm for SEP with k≥2 with time complexity O(n^3/2k^2). This improves the time complexity of existing algorithms which are at least quadratic. Also, the approximation ratio of our algorithm for k≥ 3 is 3/2 which is tight. We also give a 8-approximation algorithm for REP with time complexity O(nlog n+nk) and give a MPC version of this algorithm for k=O(1) which is the first parallel algorithm for this problem.

• 12 publications
• 21 publications
research
09/08/2023

### A 2-Approximation Algorithm for Data-Distributed Metric k-Center

In a metric space, a set of point sets of roughly the same size and an i...
research
02/06/2021

### The Maximum Exposure Problem

Given a set of points P and axis-aligned rectangles ℛ in the plane, a po...
research
10/14/2017

### Approximate Hotspots of Orthogonal Trajectories

In this paper we study the problem of finding hotspots of polygonal two-...
research
10/25/2021

### Packing 2D disks into a 3D container

In this article, we consider the problem of finding in three dimensions ...
research
01/07/2019

### Approximate Discontinuous Trajectory Hotspots

A hotspot is an axis-aligned square of fixed side length s, the duration...
research
04/17/2019

### Approximating Cumulative Pebbling Cost is Unique Games Hard

The cumulative pebbling complexity of a directed acyclic graph G is defi...
research
01/18/2022

### Improve Sentence Alignment by Divide-and-conquer

In this paper, we introduce a divide-and-conquer algorithm to improve se...