Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares” [Theor. Comput. Sci. 769 (2019) 63–74

Abstract

In the paper “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares”, Theor. Comput. Sci. 769 (2019) 63–74, the LHIT problem is proposed as follows: 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(n2).