1.5-approximation algorithm for the 2-convex recoloring problem (Q1647830): Difference between revisions

@@ Property / cites work @@
+Improved approximation algorithm for convex recoloring of trees
+Normal rank
@@ Property / cites work @@
+Quadratic kernelization for convex recoloring of trees
+Normal rank
@@ Property / cites work @@
+On the Complexity of Solving or Approximating Convex Recoloring Problems
+Normal rank
@@ Property / cites work @@
+The complexity of minimum convex coloring
@@ Property / cites work: The complexity of minimum convex coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Recoloring Revisited: Complexity and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Convex recoloring of paths
@@ Property / cites work: Convex recoloring of paths / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient approximation of convex recolorings
@@ Property / cites work: Efficient approximation of convex recolorings / rank @@
+Normal rank
@@ Property / cites work @@
+Convex recolorings of strings and trees: Definitions, hardness results and algorithms
+Normal rank
@@ Property / cites work @@
+Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
+Normal rank
@@ Property / cites work @@
+A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem
+Normal rank