The following pages link to (Q4250235):
Displaying 6 items.
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
