Complexity of minimum corridor guarding problems (Q456091): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+U05
@@ Property / Mathematics Subject Classification ID: 68U05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6098068
@@ Property / zbMATH DE Number: 6098068 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational geometry
@@ Property / zbMATH Keywords: computational geometry / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+corridor guarding
@@ Property / zbMATH Keywords: corridor guarding / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-complete
@@ Property / zbMATH Keywords: NP-complete / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2038393491
@@ Property / OpenAlex ID: W2038393491 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the tree and tour covers of a graph
@@ Property / cites work: Approximating the tree and tour covers of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A better heuristic for orthogonal graph drawings
@@ Property / cites work: A better heuristic for orthogonal graph drawings / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum corridor connection problem and other generalized geometric problems
+Normal rank
@@ Property / cites work @@
+Computing a shortest watchman path in a simple polygon in polynomial-time
+Normal rank
@@ Property / cites work @@
+Optimum watchman routes
@@ Property / cites work: Optimum watchman routes / rank @@
+Normal rank
@@ Property / cites work @@
+Touring a sequence of polygons
@@ Property / cites work: Touring a sequence of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Complexity of the minimum-length corridor problem
@@ Property / cites work: Complexity of the minimum-length corridor problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating corridors and tours via restriction and relaxation techniques
+Normal rank
@@ Property / cites work @@
+Concerning the time bounds of existing shortest watchman route algorithms
+Normal rank
@@ Property / cites work @@
+Q4694721
@@ Property / cites work: Q4694721 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest watchman routes in simple polygons
@@ Property / cites work: Shortest watchman routes in simple polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum face-spanning subgraphs of plane graphs
@@ Property / cites work: Minimum face-spanning subgraphs of plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694752
@@ Property / cites work: Q4694752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4551360
@@ Property / cites work: Q4551360 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of shortest watchman routes in simple polygons
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the watchman route and zookeeper's problems.
+Normal rank
@@ Property / cites work @@
+A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
+Normal rank
@@ Property / cites work @@
+AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
+Normal rank
@@ Property / cites work @@
+CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:456091