An online 2-dimensional clustering problem with variable sized clusters

DOI10.1007/s11081-013-9231-9zbMath1294.68149MaRDI QIDQ402248

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

zbMATH Keywords

competitive analysis; online algorithms; clustering problems

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

65K10: Numerical optimization and variational techniques

68W27: Online algorithms; streaming algorithms

Related Items

Online unit clustering and unit covering in higher dimensions

Cites Work

• Unnamed Item
• Better bounds on online unit clustering
• Online facility location with facility movements
• A randomized algorithm for online unit clustering
• A primal-dual algorithm for online non-uniform facility location
• Online unit clustering: Variations on a theme
• An improved algorithm for online unit clustering
• Online algorithms. The state of the art
• Online clustering with variable sized clusters
• Online sum-radii clustering
• On the competitive ratio for online facility location
• 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
• Incremental Clustering and Dynamic Information Retrieval