TY - GEN

T1 - Computing the greedy spanner in near-quadratic time

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Farshi, Mohammad

AU - Maheshwari, Anil

AU - Smid, Michiel

PY - 2008/10/27

Y1 - 2008/10/27

N2 - It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the greedy algorithm has cubic running time. In this paper we present an algorithm that computes the greedy spanner (spanner computed by the greedy algorithm) for a set of n points from a metric space with bounded doubling dimension in time using space. Since the lower bound for computing such spanners is Ω(n 2), the time complexity of our algorithm is optimal to within a logarithmic factor.

AB - It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the greedy algorithm has cubic running time. In this paper we present an algorithm that computes the greedy spanner (spanner computed by the greedy algorithm) for a set of n points from a metric space with bounded doubling dimension in time using space. Since the lower bound for computing such spanners is Ω(n 2), the time complexity of our algorithm is optimal to within a logarithmic factor.

UR - http://www.scopus.com/inward/record.url?scp=54249123306&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69903-3_35

DO - 10.1007/978-3-540-69903-3_35

M3 - Conference contribution

AN - SCOPUS:54249123306

SN - 3540699007

SN - 9783540699002

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 390

EP - 401

BT - Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings

T2 - 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008

Y2 - 2 July 2008 through 4 July 2008

ER -