Minimum constraint removal problem for line segments is NP-hard
Keyword(s):
Np Hard
◽
In the minimum constraint removal ([Formula: see text]), there is no feasible path to move from a starting point towards the goal, and the minimum constraints should be removed in order to find a collision-free path. It has been proved that [Formula: see text] problem is NP-hard when constraints have arbitrary shapes or even they are in shape of convex polygons. However, it has a simple linear solution when constraints are lines and the problem is open for other cases yet. In this paper, using a reduction from Subset Sum problem, in three steps, we show that the problem is NP-hard for both weighted and unweighted line segments.
2014 ◽
Vol E97.A
(1)
◽
pp. 298-299
◽
1990 ◽
Vol 26
(1)
◽
pp. 61-77
◽
1986 ◽
Vol 23
(1)
◽
pp. 11-17
◽
Keyword(s):
2017 ◽
Vol 27
(01n02)
◽
pp. 121-158
◽
2002 ◽
Vol 9
(4)
◽
pp. 437-459
◽