Parallel and sequential approximation of shortest superstrings (Q5056169): Difference between revisions

@@ Property / author @@
+Artur Czumaj
@@ Property / author: Artur Czumaj / rank @@
+Normal rank
@@ Property / author @@
+Leszek Gąsieniec
@@ Property / author: Leszek Gąsieniec / rank @@
+Normal rank
@@ Property / author @@
+Wojciech Rytter
@@ Property / author: Wojciech Rytter / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58218-5_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1501313444
@@ Property / OpenAlex ID: W1501313444 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / 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