An approximation algorithm for the Euclidean incremental median problem

DOI10.1016/j.disopt.2016.08.005zbMath1387.90116OpenAlexW2520718064MaRDI QIDQ1751197

Vladimir Shenmaier

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.08.005

zbMATH Keywords

hierarchical clusteringapproximation algorithmonline algorithmincremental mediansEuclidean medians

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Better bounds for incremental medians
• Incremental medians via online bidding
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• The Online Median Problem
• A General Approach for Incremental Approximation and Hierarchical Clustering

This page was built for publication: An approximation algorithm for the Euclidean incremental median problem