更正：“两轴平行正方形最优覆盖和命中一组线段的线性时间算法”，理论计算机科学769（2019）63--74
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
摘要：
在论文“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中，LHIT问题被提出如下：对于$I\!\!R^2$中给定的一组不相交线段${\cal L} = \{\ell_1, \ell_2, \ldots, \ell_n\}$，计算两个轴平行全等正方形${\cal S}_1$和${\cal S}_2$的最小尺寸，其并集命中$\cal L$中的所有线段，并提出了一种线性时间算法。后来发现算法有一个bug。在本勘误表中，我们更正了算法。修正算法的时间复杂度为$O(n^2)$。
英文摘要：
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 ${\cal L} = \{\ell_1, \ell_2, \ldots, \ell_n\}$ in $I\!\!R^2$, compute two axis-parallel congruent squares ${\cal S}_1$ and ${\cal S}_2$ of minimum size whose union hits all the line segments in $\cal 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)$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
