Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392): Difference between revisions

@@ Property / cites work @@
+Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Polygon-constrained motion planning problems
@@ Property / cites work: Polygon-constrained motion planning problems / rank @@
+Normal rank
@@ Property / cites work @@
+O(1)-Approximations for Maximum Movement Problems
@@ Property / cites work: O(1)-Approximations for Maximum Movement Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Annealed replication: A new heuristic for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Minimizing movement
@@ Property / cites work: Minimizing movement / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Movement: Fixed-Parameter Tractability
@@ Property / cites work: Minimizing Movement: Fixed-Parameter Tractability / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Minimizing movement in mobile facility location problems
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank