Computing the greedy spanner in near-quadratic time

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings
Pages390-401
Number of pages12
DOIs
StatePublished - 27 Oct 2008
Externally publishedYes
Event11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 - Gothenburg, Sweden
Duration: 2 Jul 20084 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5124 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Scandinavian Workshop on Algorithm Theory, SWAT 2008
Country/TerritorySweden
CityGothenburg
Period2/07/084/07/08

Fingerprint

Dive into the research topics of 'Computing the greedy spanner in near-quadratic time'. Together they form a unique fingerprint.

Cite this