Pages that link to "Item:Q3395042"
From MaRDI portal
The following pages link to Approximation Algorithms for Biclustering Problems (Q3395042):
Displaying 5 items.
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- Integer Programming of Biclustering Based on Graph Models (Q3059306) (← links)
- Improved Approximation Algorithms for Bipartite Correlation Clustering (Q3092214) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)