An online 2-dimensional clustering problem with variable sized clusters
From MaRDI portal
Recommendations
- Online clustering with variable sized clusters
- Online clustering with variable sized clusters
- Online clustering on the line with square cost variable sized clusters
- On the online unit clustering problem
- On the Online Unit Clustering Problem
- An algorithm for online \(k\)-means clustering
- A randomized algorithm for online unit clustering
- A Randomized Algorithm for Online Unit Clustering
- A new model for the linear 1-dimensional online clustering problem
- Online unit clustering in higher dimensions
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- A primal-dual algorithm for online non-uniform facility location
- A randomized algorithm for online unit clustering
- An improved algorithm for online unit clustering
- Better bounds on online unit clustering
- Incremental Clustering and Dynamic Information Retrieval
- Incremental algorithms for facility location and \(k\)-median
- Memoryless facility location in one pass
- On the competitive ratio for online facility location
- On the online unit clustering problem
- Online algorithms. The state of the art
- Online clustering on the line with square cost variable sized clusters
- Online clustering with variable sized clusters
- Online facility location with facility movements
- Online sum-radii clustering
- Online unit clustering: Variations on a theme
Cited in
(4)
This page was built for publication: An online 2-dimensional clustering problem with variable sized clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402248)