A probabilistic PTAS for shortest common superstring (Q393897): Difference between revisions

@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+More on the complexity of common superstring and supersequence problems
+Normal rank
@@ Property / cites work @@
+Linear approximation of shortest superstrings
@@ Property / cites work: Linear approximation of shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Rotations of Periodic Strings and Short Superstrings
+Normal rank
@@ Property / cites work @@
+\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+Q2904788
@@ Property / cites work: Q2904788 / rank @@
+Normal rank
@@ Property / cites work @@
+Lyndon Words and Short Superstrings
@@ Property / cites work: Lyndon Words and Short Superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+The greedy algorithm for shortest superstrings
@@ Property / cites work: The greedy algorithm for shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944967
@@ Property / cites work: Q4944967 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy algorithms for the shortest common superstring that are asymptotically optimal
+Normal rank
@@ Property / cites work @@
+Elements of Information Theory
@@ Property / cites work: Elements of Information Theory / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest common superstring problem: average case analysis for both exact and approximate matching
+Normal rank
@@ Property / cites work @@
+Why greed works for shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank