Loading...

Geometric spanners in the mapreduce model

Aghamolaei, S ; Sharif University of Technology | 2018

415 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-319-94776-1_56
  3. Publisher: Springer Verlag , 2018
  4. Abstract:
  5. A geometric spanner on a point set is a sparse graph that approximates the Euclidean distances between all pairs of points in the point set. Here, we intend to construct a geometric spanner for a massive point set, using a distributed algorithm on parallel machines. In particular, we use the MapReduce model of computation to construct spanners in several rounds with inter-communications in between. An algorithm in this model is called efficient if it uses a sublinear number of machines and runs in a polylogarithmic number of rounds. In this paper, we propose an efficient MapReduce algorithm for constructing a geometric spanner in a constant number of rounds, using linear amount of communication. The stretch factors of our spanner is (Formula Presented), for any (Formula Presented). © 2018, Springer International Publishing AG, part of Springer Nature
  6. Keywords:
  7. Computational geometry ; Geometric spanners ; MapReduce ; Parallel computation ; Combinatorial mathematics ; Euclidean distance ; Geometric spanner ; Inter-communication ; Map-reduce ; MapReduce models ; Parallel machine ; Polylogarithmic numbers
  8. Source: 24th International Conference on Computing and Combinatorics Conference, COCOON 2018, 2 July 2018 through 4 July 2018 ; Volume 10976 LNCS , 2018 , Pages 675-687 ; 03029743 (ISSN); 9783319947754 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-319-94776-1_56