Log In Sign Up

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

by   Neeraj Kumar, et al.

Given two points s and t in the plane and a set of obstacles defined by closed curves, what is the minimum number of obstacles touched by a path connecting s and t? This is a fundamental and well-studied problem arising naturally in computational geometry, graph theory (under the names Min-Color Path and Minimum Label Path), wireless sensor networks (Barrier Resilience) and motion planning (Minimum Constraint Removal). It remains NP-hard even for very simple-shaped obstacles such as unit-length line segments. In this paper we give the first constant factor approximation algorithm for this problem, resolving an open problem of [Chan and Kirkpatrick, TCS, 2014] and [Bandyapadhyay et al., CGTA, 2020]. We also obtain a constant factor approximation for the Minimum Color Prize Collecting Steiner Forest where the goal is to connect multiple request pairs (s1, t1), . . . ,(sk, tk) while minimizing the number of obstacles touched by any (si, ti) path plus a fixed cost of wi for each pair (si, ti) left disconnected. This generalizes the classic Steiner Forest and Prize-Collecting Steiner Forest problems on planar graphs, for which intricate PTASes are known. In contrast, no PTAS is possible for Min-Color Path even on planar graphs since the problem is known to be APXhard [Eiben and Kanj, TALG, 2020]. Additionally, we show that generalizations of the problem to disconnected obstacles


page 1

page 2

page 3

page 4


Removing Connected Obstacles in the Plane is FPT

Given two points in the plane, a set of obstacles defined by closed curv...

Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs

Unit disk graphs are the set of graphs which represent the intersection ...

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

Suppose we are given a pair of points s, t and a set S of n geometric ob...

How to navigate through obstacles?

Given a set of obstacles and two points, is there a path between the two...

Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane

Given two sets S and T of points in the plane, of total size n, a many-t...

On Minimum Generalized Manhattan Connections

We consider minimum-cardinality Manhattan connected sets with arbitrary ...

Geometric Firefighting in the Half-plane

In 2006, Alberto Bressan suggested the following problem. Suppose a circ...