The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W32
@@ Property / Mathematics Subject Classification ID: 68W32 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6626370
@@ Property / zbMATH DE Number: 6626370 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+shortest superstring problem
@@ Property / zbMATH Keywords: shortest superstring problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+stringology
@@ Property / zbMATH Keywords: stringology / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+data compression
@@ Property / zbMATH Keywords: data compression / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+assembly
@@ Property / zbMATH Keywords: assembly / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+greedy conjecture
@@ Property / zbMATH Keywords: greedy conjecture / rank @@
+Normal rank

Revision as of 00:32, 28 June 2023