Approximability of constrained LCS (Q439929): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2011.10.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2001332692
@@ Property / OpenAlex ID: W2001332692 / rank @@
+Normal rank
@@ Property / cites work @@
+ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
+Normal rank
@@ Property / cites work @@
+Variants of constrained longest common subsequence
+Normal rank
@@ Property / cites work @@
+On the generalized constrained longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Constrained LCS: Hardness and Approximation
@@ Property / cites work: Constrained LCS: Hardness and Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+New efficient algorithms for the LCS and constrained LCS problems
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+On finding minimal, maximal, and consistent sequences over a binary alphabet
+Normal rank
@@ Property / cites work @@
+Combined super-/substring and super-/subsequence problems
+Normal rank
@@ Property / cites work @@
+The constrained longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank