Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654): Difference between revisions

@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+On Bipartite and Multipartite Clique Problems
@@ Property / cites work: On Bipartite and Multipartite Clique Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Relations between average case complexity and approximation complexity
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Learning Theory and Kernel Machines
@@ Property / cites work: Learning Theory and Kernel Machines / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
+Normal rank
@@ Property / cites work @@
+Algorithmic and complexity issues of three clustering methods in microarray data analysis
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank