Pages that link to "Item:Q3186861"
From MaRDI portal
The following pages link to A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861):
Displaying 3 items.
- An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981) (← links)
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters (Q2396371) (← links)
- A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)