A 2-approximation algorithm for the zookeeper's problem
From MaRDI portal
Publication:845863
DOI10.1016/j.ipl.2006.06.005zbMath1185.68861OpenAlexW4234806859MaRDI QIDQ845863
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.005
Cites Work
- Shortest watchman routes in simple polygons
- Finding shortest safari routes in simple polygons
- An approximative solution to the Zookeeper's problem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon in linear time
- The zookeeper route problem
- Approximation algorithms for the watchman route and zookeeper's problems.
- Shortest zookeeper's routes in simple polygons
- Fast computation of shortest watchman routes in simple polygons
- An O\((n\log n)\) algorithm for the zoo-keeper's problem