Complexity of minimum corridor guarding problems
From MaRDI portal
Publication:456091
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1796966 (Why is no real title available?)
- scientific article; zbMATH DE number 219235 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A better heuristic for orthogonal graph drawings
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- Approximating corridors and tours via restriction and relaxation techniques
- Approximating the tree and tour covers of a graph
- Approximation algorithms for the watchman route and zookeeper's problems.
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
- Complexity of the minimum-length corridor problem
- Computing a shortest watchman path in a simple polygon in polynomial-time
- Concerning the time bounds of existing shortest watchman route algorithms
- Fast computation of shortest watchman routes in simple polygons
- Minimum face-spanning subgraphs of plane graphs
- On the minimum corridor connection problem and other generalized geometric problems
- Optimum watchman routes
- Shortest watchman routes in simple polygons
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Touring a sequence of polygons
Cited in
(5)
This page was built for publication: Complexity of minimum corridor guarding problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456091)