Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

Cite

Text

Borodin et al. "Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces." Machine Learning, 2004. doi:10.1023/B:MACH.0000033118.09057.80

Markdown

[Borodin et al. "Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces." Machine Learning, 2004.](https://mlanthology.org/mlj/2004/borodin2004mlj-subquadratic/) doi:10.1023/B:MACH.0000033118.09057.80

BibTeX

@article{borodin2004mlj-subquadratic,
  title     = {{Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces}},
  author    = {Borodin, Allan and Ostrovsky, Rafail and Rabani, Yuval},
  journal   = {Machine Learning},
  year      = {2004},
  pages     = {153-167},
  doi       = {10.1023/B:MACH.0000033118.09057.80},
  volume    = {56},
  url       = {https://mlanthology.org/mlj/2004/borodin2004mlj-subquadratic/}
}