Improved length bounds for the shortest superstring problem (Q5057460): Difference between revisions

@@ Property / cites work @@
+Linear approximation of shortest superstrings
@@ Property / cites work: Linear approximation of shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel and sequential approximation of shortest superstrings
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Faster implementation of a shortest superstring approximation
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the all pairs suffix-prefix problem
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly qth Power–Free Strings
@@ Property / cites work: Strongly qth Power–Free Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4859180
@@ Property / cites work: Q4859180 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+Approximating Shortest Superstrings
@@ Property / cites work: Approximating Shortest Superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the shortest common superstring problem
+Normal rank