Distribution-sensitive construction of the greedy spanner
type: Item
instance of: scholarly article
title: Distribution-sensitive construction of the greedy spanner
zbMATH Open document ID: 1360.68867
author: Sander P. A. Alewijnse
author: Quirijn W. Bouts
author: Alex P. ten Brink
author: Kevin Buchin
published in: Algorithmica
publication date: 2017-05-11T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6714289
zbMATH Keywords: computational geometry
zbMATH Keywords: spanners
zbMATH Keywords: greedy spanner
zbMATH Keywords: uniform points
Wikidata QID: Q59517593
MaRDI profile type: Publication
full work available at URL: s00453-016-0160-9
OpenAlex ID: W2155971496
cites work: Region-fault tolerant geometric spanners
cites work: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
cites work: Computing the greedy spanner in linear space
cites work: Some dynamic computational geometry problems
cites work: Computing the greedy spanner in near-quadratic time
cites work: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
cites work: A Framework for Computing the Greedy Spanner
cites work: Constructing Delaunay Triangulations along Space-Filling Curves
cites work: There are planar graphs almost as good as the complete graph
cites work: The expected size of some graphs in computational geometry
cites work: On the expected maximum degree of Gabriel and Yao graphs
cites work: Minimum dilation stars
cites work: Testing Euclidean Spanners
cites work: Q3802644
cites work: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
cites work: Approximating the Stretch Factor of Euclidean Graphs
cites work: Geometric Spanner Networks
cites work: Graph spanners
cites work: Q4325546
cites work: Q5691080
cites work: Probability theory of classical Euclidean optimization problems
DBLP publication ID: journals/algorithmica/AlewijnseBBB17
DOI: 10.1007/S00453-016-0160-9
Recommended article: Distribution-Sensitive Construction of the Greedy Spanner
Recommended article: A Framework for Computing the Greedy Spanner
Recommended article: Improved deterministic distributed construction of spanners
Recommended article: Distributed Spanner Approximation
Recommended article: Computing the Greedy Spanner in Near-Quadratic Time
Recommended article: Computing the greedy spanner in near-quadratic time
Recommended article: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
Recommended article: Fast deterministic distributed algorithms for sparse spanners
description: scientific article; zbMATH DE number 6714289