Research map / Learning theory and algorithms / Submodular and game algorithms
Efficient and Stable Fully Dynamic Facility Location
Sayan Bhattacharya, Silvio Lattanzi, Nikos Parotsidis
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use smaller mu and epsilon (mu=3, eps=0.05 instead of eps=1) (ablation) | NiceClustering · KDD-Cup-5% and KDD-Cup-50% | solution cost | Improved |
| Use smaller mu and epsilon (ablation) | NiceClustering · KDD-Cup-5% and KDD-Cup-50% | recourse | Hurt |
| Replace GKLX with NiceClustering (mu=3, eps=0.05) | fully dynamic facility location · KDD-Cup-5% | solution cost: 17%-29% better | Improved |
| Replace GKLX with NiceClustering (mu=3, eps=0.05) | fully dynamic facility location · KDD-Cup-50% | solution cost: 55%-67% better | Improved |
| Replace GKLX with NiceClustering (mu=3, eps=0.05) | fully dynamic facility location · Census and song | solution cost: 14%-30% | Improved |
| Replace GKLX with NiceClustering | fully dynamic facility location · KDD-Cup-5% | recourse | Hurt |
| Replace GKLX with NiceClustering | fully dynamic facility location · KDD-Cup-50% | recourse | No clear effect |
| Replace GKLX with NiceClustering (mu=3, eps=1 or mu=1, eps=1) | fully dynamic facility location · KDD-Cup-5% and KDD-Cup-50% | running time | Hurt |
| Use mu=3, eps=0.05 instead of mu=3, eps=1 (ablation) | NiceClustering · KDD-Cup-5% and KDD-Cup-50% | running time | Hurt |
| Use NiceClustering (mu=3, eps=0.05) instead of GreedyOff rerun | fully dynamic facility location · KDD-Cup-5% and KDD-Cup-50% | solution cost | No clear effect |
| Use NiceClustering instead of rerunning GreedyOff | fully dynamic facility location · KDD-Cup-5% and KDD-Cup-50% | running time | Improved |
| Use mu=1, eps=0.05 instead of mu=3, eps=0.05 (ablation) | NiceClustering · KDD-Cup | solution cost and time | No clear effect |
Closest papers by meaning
- Dynamic Facility Location in High Dimensional Euclidean Spaces (ICML 2024 · similarity 0.90)
- Learning-Augmented Dynamic Submodular Maximization (NeurIPS 2024 · similarity 0.81)
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.81)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.80)
- Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale (NeurIPS 2026 · similarity 0.80)
- Dynamic k-center clustering with lifetimes (NeurIPS 2026 · similarity 0.80)
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.
