Linear Time Algorithms for Clustering Problems in Any Dimensions

Amit Kumar, Yogish Sabharwal, Sandeep Sen. Linear Time Algorithms for Clustering Problems in Any Dimensions. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 1374-1385, Springer, 2005. [doi]

@inproceedings{KumarSS05:0,
  title = {Linear Time Algorithms for Clustering Problems in Any Dimensions},
  author = {Amit Kumar and Yogish Sabharwal and Sandeep Sen},
  year = {2005},
  doi = {10.1007/11523468_111},
  url = {http://dx.doi.org/10.1007/11523468_111},
  researchr = {https://researchr.org/publication/KumarSS05%3A0},
  cites = {0},
  citedby = {0},
  pages = {1374-1385},
  booktitle = {Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  editor = {Luís Caires and Giuseppe F. Italiano and Luís Monteiro and Catuscia Palamidessi and Moti Yung},
  volume = {3580},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-27580-0},
}