Pages that link to "Item:Q1744981"
From MaRDI portal
The following pages link to An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981):
Displaying 5 items.
- An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
- Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189) (← links)
- A sequential aggregation algorithm for the set partitioning problem (Q1819547) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)