Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
DOI10.1016/J.TCS.2019.09.044zbMATH Open1435.68352OpenAlexW2980805269MaRDI QIDQ2285159FDOQ2285159
Authors: Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy 
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.044
Recommendations
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Optimal covering and hitting of line segments by two axis-parallel squares
- Corrigendum: An \(O(n^{lg\,k}\cdot 2^{n/2})\) time and \(O(k\cdot s^{n/k})\) space algorithm for certain NP-complete problems
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
- On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
Cited In (2)
This page was built for publication: Corrigendum to: ``Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285159)
