Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics

David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann. Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 540-559, IEEE Computer Society, 2019. [doi]

@inproceedings{SaulpicCF19,
  title = {Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics},
  author = {David Saulpic and Vincent Cohen-Addad and Andreas Emil Feldmann},
  year = {2019},
  doi = {10.1109/FOCS.2019.00041},
  url = {https://doi.org/10.1109/FOCS.2019.00041},
  researchr = {https://researchr.org/publication/SaulpicCF19},
  cites = {0},
  citedby = {0},
  pages = {540-559},
  booktitle = {60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019},
  editor = {David Zuckerman},
  publisher = {IEEE Computer Society},
  isbn = {978-1-7281-4952-3},
}