Loading...

Online Unit Clustering in Two Dimensions

Abbasi, Mohsen | 2014

951 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46121 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Zarrabi-Zadeh, Hamid
  7. Abstract:
  8. In the unit clustering problem, given a set of points on the plane, the goal is to group these points into minimum number of clusters of unit size. In the online version, the points arrive one by one and upon each point’s arrival, it must be assigned to some cluster. Another related problem is online unit covering in which moving clusters after opening them is not allowed. In this project, the online clustering and online unit covering problems are studied in two dimensional Euclidean space. An online algorithm with competitive ratio of 5 is presented for the online unit covering problem. In addition, lowerbounds of 2:5 and 4:66 are established for these problems
  9. Keywords:
  10. Clustering ; Coverage ; Unit Coverage ; Online Unit ; Competetive Ratio

 Digital Object List