Better bounds for incremental medians

DOI10.1016/j.tcs.2009.07.006zbMath1206.68372OpenAlexW2127375409MaRDI QIDQ627114

Mathilde Hurand, Marek Chrobak

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.006

zbMATH Keywords

online algorithmsanalysis of algorithmsapproximation algorithmsincremental medians

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Competitive Strategies for Online Clique Clustering ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ A 16-competitive algorithm for hierarchical median problem ⋮ An approximation algorithm for the Euclidean incremental median problem ⋮ Online clique clustering

Cites Work

• Oblivious Medians Via Online Bidding
• A general approach for incremental approximation and hierarchical clustering
• Local Search Heuristics for k-Median and Facility Location Problems
• The Online Median Problem
• Local search heuristic for k-median and facility location problems

This page was built for publication: Better bounds for incremental medians