Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares” (Theoretical Computer Science (2019) 769 (63–74), (S0304397518306303), (10.1016/j.tcs.2018.10.013))

Authors

Sanjib Sadhu, National Institute of Technology, Durgapur
Xiaozhou He, Sichuan University
Sasanka Roy, Indian Statistical Institute, Kolkata
Subhas C. Nandy, Indian Statistical Institute, Kolkata
Suchismita Roy, National Institute of Technology, Durgapur

Article Type

Research Article

Publication Title

Theoretical Computer Science

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: For a given set of non-intersecting line segments L={ℓ1,ℓ2,…,ℓn} in [Formula presented], compute two axis-parallel congruent squares S1 and S2 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(n2).

First Page

632

Last Page

640

DOI

10.1016/j.tcs.2019.09.044

Publication Date

2-2-2020

Comments

Open Access, Bronze

Recommended Citation

Sadhu, Sanjib; He, Xiaozhou; Roy, Sasanka; Nandy, Subhas C.; and Roy, Suchismita, "Corrigendum to: “Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares” (Theoretical Computer Science (2019) 769 (63–74), (S0304397518306303), (10.1016/j.tcs.2018.10.013))" (2020). Journal Articles. 393.
https://digitalcommons.isical.ac.in/journal-articles/393