A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005): Difference between revisions

@@ Property / cites work @@
+Improved length bounds for the shortest superstring problem
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation 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 @@
+Parallel and sequential approximation of shortest superstrings
+Normal rank
@@ Property / cites work @@
+Q2776563
@@ Property / cites work: Q2776563 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy algorithms for the shortest common superstring that are asymptotically optimal
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2731676
@@ Property / cites work: Q2731676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3409986
@@ Property / cites work: Q3409986 / rank @@
+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 @@
+GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
+Normal rank
@@ Property / cites work @@
+Why Greed Works for Shortest Common Superstring Problem
+Normal rank
@@ Property / cites work @@
+Information compression by factorising common strings
+Normal rank
@@ Property / cites work @@
+Shortest common superstrings and scheduling with coordinated starting times
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Q4944967
@@ Property / cites work: Q4944967 / rank @@
+Normal rank
@@ Property / cites work @@
+A hybrid heuristic for the \(p\)-median problem
@@ Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank @@
+Normal rank
@@ Property / cites work @@
+The macro model for data compression (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Data compression via textual substitution
@@ Property / cites work: Data compression via textual substitution / rank @@
+Normal rank
@@ Property / cites work @@
+\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+The shortest common superstring problem: average case analysis for both exact and approximate matching
+Normal rank