A constant factor approximation for navigating through connected obstacles in the plane
Pages 822 - 839
Abstract
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 APX-hard [Eiben and Kanj, TALG, 2020]. Additionally, we show that generalizations of the problem to disconnected obstacles in the plane or connected obstacles in higher dimensions are strongly inapproximable assuming some well-known hardness conjectures.
References
[1]
S. Bandyapadhyay, N. Kumar, S. Sum, and K. R. Varadarajan, Improved approximation bounds for the minimum constraint removal problem, Comput. Geom., 90 (2020), p. 101650.
[2]
M. Bateni, C. Chekuri, A. Ene, M. T. Hajiaghayi, N. Korula, and D. Marx, Prize-collecting steiner problems on planar graphs, in Proc. of 22nd SODA, 2011, pp. 1028--1049.
[3]
M. Bateni, E. D. Demaine, M. Hajiaghayi, and D. Marx, A PTAS for planar group steiner tree via spanner bootstrapping and prize collecting, in Proc. of 48th STOC, ACM, 2016, pp. 570--583.
[4]
M. Bateni, M. T. Hajiaghayi, and D. Marx, Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth, J. ACM, 58 (2011), pp. 21:1--21:37.
[5]
S. Bereg and D. G. Kirkpatrick, Approximating barrier resilience in wireless sensor networks, in Proc. of 5th ALGOSENSORS, vol. 5804, 2009, pp. 29--40.
[6]
G. Borradaile, C. Kenyon-Mathieu, and P. N. Klein, A polynomial-time approximation scheme for steiner tree in planar graphs, in Proc. of 18th SODA, 2007, pp. 1285--1294.
[7]
G. Borradaile, P. N. Klein, and C. Mathieu, An O(n log n) approximation scheme for steiner tree in planar graphs, ACM Trans. Algorithms, 5 (2009), pp. 1--31.
[8]
S. Cabello and P. Giannopoulos, The complexity of separating points in the plane, Algorithmica, 74 (2016), pp. 643--663.
[9]
R. D. Carr, S. Doddi, G. Konjevod, and M. V. Marathe, On the red-blue set cover problem, in Proc. of 11th SODA, 2000, pp. 345--353.
[10]
D. Y. C. Chan and D. G. Kirkpatrick, Approximating barrier resilience for arrangements of non-identical disk sensors, in Proc. of 8th ALGOSENSORS, 2012, pp. 42--53.
[11]
D. Y. C. Chan and D. G. Kirkpatrick, Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience, Theor. Comput. Sci., 553 (2014), pp. 74--90.
[12]
E. Chlamtác, M. Dinitz, and Y. Makarychev, Minimizing the union: Tight approximations for small set bipartite vertex expansion, in Proc. of 28th SODA, 2017, pp. 881--899.
[13]
E. D. Demaine, M. T. Hajiaghayi, and P. N. Klein, Node-weighted steiner tree and group steiner tree in planar graphs, ACM Trans. Algorithms, 10 (2014), pp. 13:1--13:20.
[14]
E. Eiben, J. Gemmell, I. A. Kanj, and A. Youngdahl, Improved results for minimum constraint removal, in Proc. of 32nd AAAI, 2018, pp. 6477--6484.
[15]
E. Eiben and I. A. Kanj, A colored path problem and its applications, ACM Trans. Algorithms, 16 (2020), pp. 47:1--47:48.
[16]
E. Eiben and D. Lokshtanov, Removing connected obstacles in the plane is FPT, in Proc. of 36th SoCG, vol. 164, 2020, pp. 39:1--39:14.
[17]
D. Eisenstat, P. N. Klein, and C. Mathieu, An efficient polynomial-time approximation scheme for steiner forest in planar graphs, in Proc. of 23rd SODA, 2012, pp. 626--638.
[18]
L. H. Erickson and S. M. LaValle, A simple, but NP-Hard, motion planning problem, in Proc. of 27th AAAI, 2013.
[19]
M. T. Hajiaghayi, R. Khandekar, G. Kortsarz, and Z. Nutov, Prize-collecting steiner network problems, ACM Trans. Algorithms, 9 (2012), pp. 2:1--2:13.
[20]
T. C. Hales, The jordan curve theorem, formally and informally, The American Mathematical Monthly, 114 (2007), pp. 882--894.
[21]
R. Hassin, J. Monnot, and D. Segev, Approximation algorithms and hardness results for labeled connectivity problems, J. Comb. Optim., 14 (2007), pp. 437--453.
[22]
K. K. Hauser, The minimum constraint removal problem with three robotics applications, I. J. Robotics Res., 33 (2014), pp. 5--17.
[23]
A. Itai and Y. Shiloach, Maximum flow in planar networks, SIAM J. Comput., 8 (1979), pp. 135--150.
[24]
R. Jacob, G. Koniedov, S. Krumke, M. Marathe, R. Ravi, and H. Wirth, The minimum label path problem, Unpublished manuscript, Los Alamos National Laboratory, (1999).
[25]
S. Khot, D. Minzer, and M. Safra, Pseudorandom sets in grassmann graph have near-perfect expansion, in 59th FOCS, 2018, pp. 592--601.
[26]
S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2 − ϵ, J. Comput. Syst. Sci., 74 (2008), pp. 335--349.
[27]
P. N. Klein, S. A. Plotkin, and S. Rao, Excluded minors, network decomposition, and multicommodity flow, in Proc. of 25th STOC, 1993, pp. 682--690.
[28]
M. Korman, M. Löffler, R. I. Silveira, and D. Strash, On the complexity of barrier resilience for fat regions and bounded ply, Comput. Geom., 72 (2018), pp. 34--51.
[29]
A. Krontiris and K. E. Bekris, Trade-off in the computation of minimum constraint removal paths for manipulation planning, Adv. Robotics, 31 (2017), pp. 1313--1324.
[30]
N. Kumar, Computing a minimum color path in edge-colored graphs, in Proc. of 18th SEA, 2019, pp. 35--50.
[31]
S. Kumar, T. Lai, and A. Arora, Barrier coverage with wireless sensors, Wirel. Networks, 13 (2007), pp. 817--834.
[32]
J. R. Lee, Separators in region intersection graphs, in Proc. of 8th ITCS, (https://arxiv.org/abs/1608.01612v3), vol. 67, 2017, pp. 1--8.
[33]
F. T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787--832.
[34]
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, 1982.
[35]
K.-C. R. Tseng and D. Kirkpatrick, On barrier resilience of sensor networks, in Proc. of 5th ALGOSENSORS, Springer, 2011, pp. 130--144.
[36]
B. Xu and H. Min, Solving minimum constraint removal (MCR) problem using a social-force-model-based ant colony algorithm, Appl. Soft Comput., 43 (2016), pp. 553--560.
- A constant factor approximation for navigating through connected obstacles in the plane
Recommendations
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
The selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G=(V,E) with weight function c, and two subsets RźźR⊆V with |RźRź|ź2, selected-internal Steiner minimum tree ...
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
Special Issue: Computation and Combinatorial Optimization; Guest Editors: Xiaodong Hu and Jie WangThe selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G=(V,E) with weight function c, and two subsets R ′ ⊊ R⊆V with |R−R ′|≥2, selected-internal Steiner minimum ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 21 March 2021
Check for updates
Qualifiers
- Research-article
Conference
SODA '21
Sponsor:
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in