Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74

09/20/2019

∙

by   Sanjib Sadhu, et al.

∙

0

∙

share

In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line segments L = {ℓ_1, ℓ_2, ..., ℓ_n} in IR^2, compute two axis-parallel congruent squares S_1 and S_2 of minimum size whose union hits all the line segments in L, and a linear time algorithm was proposed. Later it was observed that the algorithm has a bug. In this corrigendum, we corrected the algorithm. The time complexity of the corrected algorithm is O(n^2).