Efficient Parallel Algorithms for Geometric k-Clustering Problems

Amitava Datta. Efficient Parallel Algorithms for Geometric k-Clustering Problems. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 475-486, Springer, 1994.

@inproceedings{Datta94:1,
  title = {Efficient Parallel Algorithms for Geometric k-Clustering Problems},
  author = {Amitava Datta},
  year = {1994},
  researchr = {https://researchr.org/publication/Datta94%3A1},
  cites = {0},
  citedby = {0},
  pages = {475-486},
  booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
  editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
  volume = {775},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57785-8},
}