Computing the greedy spanner in linear space
type: Item
instance of: scholarly article
title: Computing the greedy spanner in linear space
zbMATH Open document ID: 1325.68245
author: Sander P. A. Alewijnse
author: Quirijn W. Bouts
author: Alex P. ten Brink
author: Kevin Buchin
published in: Algorithmica
publication date: 2015-11-19T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6511729
zbMATH Keywords: geometric spanner
zbMATH Keywords: dilation
zbMATH Keywords: stretch factor
zbMATH Keywords: greedy algorithm
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: s00453-015-0001-2
OpenAlex ID: W2126497992
Wikidata QID: Q59427635
cites work: Distribution-Sensitive Construction of the Greedy Spanner
cites work: Computing the greedy spanner in near-quadratic time
cites work: A Framework for Computing the Greedy Spanner
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: There are planar graphs almost as good as the complete graph
cites work: Experimental study of geometric t -spanners
cites work: Computing the shortest path: \(A^\ast\) search meets graph theory
cites work: Q3802644
cites work: Geometric Spanner Networks
cites work: Graph spanners
DBLP publication ID: journals/algorithmica/AlewijnseBBB15
DOI: 10.1007/S00453-015-0001-2
description: scientific article; zbMATH DE number 6511729