Loading...

Improvements on the k-center problem for uncertain data extended abstract

Alipour, S ; Sharif University of Technology | 2018

419 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/3196959.3196969
  3. Publisher: Association for Computing Machinery , 2018
  4. Abstract:
  5. In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. The assigned version of the k-center problem for n uncertain points in a metric space is studied in this paper. The main approach is to replace each uncertain point with a clever choice of a certain point. We argue that the k-center solution for these certain replacements of our uncertain points, is a good constant approximation factor for the original uncertain k-center problem. This approach enables us to present fast and simple algorithms that give 10-approximation solution for the k-center problem in any metric space and when the ambient space is Euclidean, it can be improved to (3 + ϵ)-approximation for any ϵ > 0. These algorithms improve both the approximation factor and the running time of the previously known algorithms. Also, our algorithms are suitable for applying in the case of streaming and big data. © 2018 Association for Computing Machinery
  6. Keywords:
  7. Approximation algorithm ; K-center roblem ; Big data ; Database systems ; Set theory ; Topology ; Approximation factor ; Extended abstracts ; Geometric optimization ; K-center ; Real applications ; Simple algorithm ; Uncertain modeling ; Uncertain points ; Approximation algorithms
  8. Source: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; 27 May , 2018 , Pages 425-433 ; 9781450347068 (ISBN)
  9. URL: https://dl.acm.org/citation.cfm?id=3196969