An approximation ratio for biclustering (Q975394): Difference between revisions

@@ Property / OpenAlex ID @@
+W2152668278
@@ Property / OpenAlex ID: W2152668278 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2682
@@ Property / arXiv ID: 0712.2682 / rank @@
+Normal rank
@@ Property / cites work @@
+Consensus algorithms for the generation of all maximal bicliques
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
+Normal rank
@@ Property / cites work @@
+Clustering large graphs via the singular value decomposition
+Normal rank
@@ Property / cites work @@
+Arboricity and bipartite subgraph listing algorithms
+Normal rank
@@ Property / cites work @@
+Approximating Clique and Biclique Problems
@@ Property / cites work: Approximating Clique and Biclique Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994557
@@ Property / cites work: Q3994557 / rank @@
+Normal rank
@@ Property / cites work @@
+A local search approximation algorithm for \(k\)-means clustering
+Normal rank