Greedy spanner algorithms in practice

Spanners generated by the greedy algorithm - or greedy spanners - not only have good theoretical properties, like a linear number of edges, low degree and low weight, but also, as previous experimental results show, they are superior to spanners generated by other algorithms in practice. Because of the good properties of greedy spanners, they found several applications like in protein visualization. The major issue in computing greedy spanners is the high time and space complexity of algorithms that compute it. To construct the greedy spanner on a set of n points, the original greedy algorithm takes O(n(3) log n) time. In 2005, an improvement was proposed by Farshi and Gudmundsson [Lecture Notes in Computer Science, Vol. 3669, pages 556-567] that works much faster in practice, but later it was shown that it has same theoretical time complexity. In 2008, Bose at al. [Lecture Notes in Computer Science, Vol. 5124, pages 390-401] discovered a near-quadratic time algorithm for constructing greedy spanners. In this paper, we compare time complexity of these three algorithms for computing the greedy spanner in practice. (C) 2014 Sharif University of Technology. All rights reserved.