Better Bounds for Incremental Medians

DOI10.1007/978-3-540-77918-6_17zbMath1130.90026OpenAlexW2151812150MaRDI QIDQ5443384

Mathilde Hurand, Marek Chrobak

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_17

zbMATH Keywords

approximation algorithmanalysis of algorithmsonline algorithmincremental medians

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items

Incremental facility location problem and its competitive algorithms ⋮ An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem

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