The following pages link to Geometric clustering (Q3189027):
Displaying 10 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices (Q1763002) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- (Q3504608) (← links)
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS (Q3634189) (← links)
- (Q5111721) (← links)
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)
