Pages that link to "Item:Q2630015"
From MaRDI portal
The following pages link to Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015):
Displayed 7 items.
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← 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)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
- Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem (Q4965097) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)