Online clustering with variable sized clusters

DOI10.1007/s00453-011-9586-2zbMath1258.68180OpenAlexW2115391572MaRDI QIDQ1939661

Leah Epstein, Asaf Levin, Csanád Imreh, János A. Csirik

Publication date: 5 March 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9586-2

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10) Online algorithms; streaming algorithms (68W27)

Related Items (9)

Online unit clustering and unit covering in higher dimensions ⋮ Hierarchy cost of hierarchical clusterings ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ An online 2-dimensional clustering problem with variable sized clusters ⋮ Dynamic clustering to minimize the sum of radii ⋮ Online sum-radii clustering ⋮ An improved lower bound for one-dimensional online unit clustering ⋮ A new model for the linear 1-dimensional online clustering problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Clustering to minimize the sum of cluster diameters
• On the competitive ratio for online facility location
• Incremental algorithms for facility location and \(k\)-median
• On the online unit clustering problem
• Better Bounds on Online Unit Clustering
• Variable-Size Rectangle Covering
• Totally-Balanced and Greedy Matrices
• Incremental Clustering and Dynamic Information Retrieval
• Profit-earning facility location
• Memoryless Facility Location in One Pass

This page was built for publication: Online clustering with variable sized clusters