An online 2-dimensional clustering problem with variable sized clusters
DOI10.1007/S11081-013-9231-9zbMATH Open1294.68149OpenAlexW1964239153MaRDI QIDQ402248FDOQ402248
Authors: Gabriella Divéki, Csanád Imreh 
Publication date: 27 August 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-013-9231-9
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical optimization and variational techniques (65K10) Online algorithms; streaming algorithms (68W27)
Cites Work
- Title not available (Why is that?)
- Online algorithms. The state of the art
- On the competitive ratio for online facility location
- A primal-dual algorithm for online non-uniform facility location
- An improved algorithm for online unit clustering
- Better bounds on online unit clustering
- Incremental Clustering and Dynamic Information Retrieval
- A randomized algorithm for online unit clustering
- Online unit clustering: Variations on a theme
- Online clustering with variable sized clusters
- Online sum-radii clustering
- Incremental algorithms for facility location and \(k\)-median
- Online clustering on the line with square cost variable sized clusters
- On the online unit clustering problem
- Memoryless facility location in one pass
- Online facility location with facility movements
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)
