The following pages link to (Q4250235):
Displaying 22 items.
- Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes (Q844164) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Exact and approximation algorithms for clustering (Q1601015) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems (Q1644926) (← links)
- Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes. (Q1811624) (← links)
- An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem (Q2026155) (← links)
- An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
- (Q3191565) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Linear-time approximation schemes for clustering problems in any dimensions (Q3578186) (← links)
- (Q4576266) (← links)
- Range-clustering queries (Q4580076) (← links)
- Approximation algorithms for projective clustering (Q4808316) (← links)
- The Complete Gradient Clustering Algorithm: properties in practical applications (Q5127032) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
