On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776): Difference between revisions

@@ Property / author @@
+Juraj Hromkovič
@@ Property / author: Juraj Hromkovič / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M10
@@ Property / Mathematics Subject Classification ID: 68M10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6039170
@@ Property / zbMATH DE Number: 6039170 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+topic-connected overlay
@@ Property / zbMATH Keywords: topic-connected overlay / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+APX
@@ Property / zbMATH Keywords: APX / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hardness
@@ Property / zbMATH Keywords: hardness / rank @@
+Normal rank

Revision as of 21:12, 29 June 2023