ScholarLens Back to search
2014•Unpublished venueOpen access

A Framework for Computing the Greedy Spanner

Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin

Open full text 6 citations

Abstract

The highest quality geometric spanner (e.g. in terms of edge count, both in theory and in practice) known to be computable in polynomial time is the greedy spanner. The state-of-the-art in computing this spanner are a O(n2 log n) time, O(n2) space algorithm and a O(n2 log2 n) time, O(n) space algorithm, as well as the 'improved greedy' algorithm, taking O(n3 log n) time in the worst case and O(n2) space but being faster in practice thanks to a caching strategy.

About this research paper

What this paper is about

The highest quality geometric spanner (e.g. in terms of edge count, both in theory and in practice) known to be computable in polynomial time is the greedy spanner. The state-of-the-art in computing this spanner are a O(n2 log n) time, O(n2) space algorithm and a O(n2 log2 n) time, O(n) space algorithm, as well as the 'improved greedy' algorithm, taking O(n3 log n) time in the worst case and O(n2) space but being faster in practice thanks to a caching strategy.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The highest quality geometric spanner (e.g. in terms of edge count, both in theory and in practice) known to be computable in polynomial time is the greedy spanner. The state-of-the-art in computing this spanner are a O(n2 log n) time, O(n2) space algorithm and a O(n2 log2 n) time, O(n) space algorithm, as well as the 'improved greedy' algorithm, taking O(n3 log n) time in the worst case and O(n2) space but being faster in practice thanks to a caching strategy.

Key concepts: Spanner, Greedy algorithm, Computer science, Time complexity, Enhanced Data Rates for GSM Evolution, Combinatorics, Binary logarithm, Space (punctuation)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Framework for Computing the Greedy Spanner — Research Paper | ScholarLens