Algorithms and Computation
From MaRDI portal
Publication:5712171
DOI10.1007/b104582zbMath1116.68650OpenAlexW2491382297MaRDI QIDQ5712171
Publication date: 22 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104582
Related Items (4)
Sweeping simple polygons with the minimum number of chain guards ⋮ Optimum sweeps of simple polygons with two guards ⋮ A unified and efficient solution to the room search problem ⋮ An efficient algorithm for the three-guard problem
This page was built for publication: Algorithms and Computation