Pages that link to "Item:Q498594"
From MaRDI portal
The following pages link to An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594):
Displaying 6 items.
- Sequential clustering with radius and split criteria (Q351557) (← links)
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)