AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Fully Dynamic Consistent Facility Location

Vincent Cohen-Addad, Niklas Oskar D Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn

NeurIPS 2019 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 11 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
maintain solution across a period with substitute centers instead of re-running Meyerson after every updateMeyerson's algorithm for facility location · Twitter, covertype, USCensus1990running time: 100 times faster than MeyersonRecImproved
maintain solution across a period instead of re-running Meyerson every updateMeyerson's algorithm · Twitter, covertype, USCensus1990solution costNo clear effect
periodic recompute with bounded recourse versus re-running Meyerson each updateMeyerson's algorithm · Twitter, covertype, USCensus1990recourseImproved
compare against single-run MeyersonSingle that never removes facilitiesFully dynamic facility location · Twitter, covertype, USCensus1990recourseHurt
vary facility cost f (ablation)Fully dynamic facility location · experimentsrecourseNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy