Pages that link to "Item:Q1746358"
From MaRDI portal
The following pages link to Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358):
Displaying 6 items.
- An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← 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)
- 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316) (← links)
