eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-08-13
2:1
2:19
10.4230/LIPIcs.APPROX-RANDOM.2018.2
article
Improved Approximation Bounds for the Minimum Constraint Removal Problem
Bandyapadhyay, Sayan
1
Kumar, Neeraj
2
Suri, Subhash
2
Varadarajan, Kasturi
1
Department of Computer Science, University of Iowa, Iowa City, USA
Department of Computer Science, University of California, Santa Barbara, USA
In the minimum constraint removal problem, we are given a set of geometric objects as obstacles in the plane, and we want to find the minimum number of obstacles that must be removed to reach a target point t from the source point s by an obstacle-free path. The problem is known to be intractable, and (perhaps surprisingly) no sub-linear approximations are known even for simple obstacles such as rectangles and disks. The main result of our paper is a new approximation technique that gives O(sqrt{n})-approximation for rectangles, disks as well as rectilinear polygons. The technique also gives O(sqrt{n})-approximation for the minimum color path problem in graphs. We also present some inapproximability results for the geometric constraint removal problem.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol116-approx-random2018/LIPIcs.APPROX-RANDOM.2018.2/LIPIcs.APPROX-RANDOM.2018.2.pdf
Minimum Constraint Removal
Minimum Color Path
Barrier Resilience
Obstacle Removal
Obstacle Free Path
Approximation