Approximation algorithms for the watchman route and zookeeper's problems
From MaRDI portal
Recommendations
Cited in
(9)- An approximative solution to the Zookeeper's problem
- Watchman routes under limited visibility
- Approximation algorithms for the watchman route and zookeeper's problems.
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Complexity of minimum corridor guarding problems
- Concerning the time bounds of existing shortest watchman route algorithms
- Approximating watchman routes
- A 2-approximation algorithm for the zookeeper's problem
This page was built for publication: Approximation algorithms for the watchman route and zookeeper's problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551360)