An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities
From MaRDI portal
Publication:3133210
Recommendations
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
- Approximation algorithm for the problem of partitioning a sequence into clusters
- An approximating polynomial algorithm for a sequence partitioning problem
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
Cited in
(6)- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities
- A sequential aggregation algorithm for the set partitioning problem
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Approximation algorithm for the problem of partitioning a sequence into clusters
- An approximation polynomial-time algorithm for a sequence bi-clustering problem
This page was built for publication: An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133210)