k -center Clustering under Perturbation Resilience
From MaRDI portal
Publication:4987439
DOI10.1145/3381424zbMath1484.68066OpenAlexW3011209672MaRDI QIDQ4987439
Nika Haghtalab, Colin White, Maria-Florina Balcan
Publication date: 3 May 2021
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3381424
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: k -center Clustering under Perturbation Resilience