Pages that link to "Item:Q1811624"
From MaRDI portal
The following pages link to Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624):
Displaying 6 items.
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- Sphere-separable partitions of multi-parameter elements (Q2478428) (← links)
- (Q4250235) (← links)
- Approximation Schemes for Capacitated Clustering in Doubling Metrics (Q5146927) (← links)
- Approximating min-sum <i>k</i> -clustering in metric spaces (Q5175948) (← links)