Distribution-sensitive construction of the greedy spanner
DOI10.1007/S00453-016-0160-9zbMATH Open1360.68867DBLPjournals/algorithmica/AlewijnseBBB17OpenAlexW2155971496WikidataQ59517593 ScholiaQ59517593MaRDI QIDQ527422FDOQ527422
Authors: Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin 
Publication date: 11 May 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0160-9
Recommendations
- Distribution-sensitive construction of the greedy spanner
- A framework for computing the greedy spanner
- Improved deterministic distributed construction of spanners
- Distributed spanner approximation
- Distributed Spanner Approximation
- Computing the Greedy Spanner in Near-Quadratic Time
- Computing the greedy spanner in near-quadratic time
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- Fast deterministic distributed algorithms for sparse spanners
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Probability theory of classical Euclidean optimization problems
- Geometric Spanner Networks
- Title not available (Why is that?)
- There are planar graphs almost as good as the complete graph
- Graph spanners
- Title not available (Why is that?)
- Some dynamic computational geometry problems
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- Title not available (Why is that?)
- Region-fault tolerant geometric spanners
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Approximating the Stretch Factor of Euclidean Graphs
- The expected size of some graphs in computational geometry
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
- Computing the greedy spanner in near-quadratic time
- On the expected maximum degree of Gabriel and Yao graphs
- Constructing Delaunay Triangulations along Space-Filling Curves
- A framework for computing the greedy spanner
- Testing Euclidean Spanners
- Minimum dilation stars
- Computing the greedy spanner in linear space
Cited In (9)
- A simple and efficient method for accelerating construction of the gap-greedy spanner
- Computing the greedy spanner in linear space
- A framework for computing the greedy spanner
- Computing the greedy spanner in linear space
- The emergence of sparse spanners and greedy well-separated pair decomposition
- \(\delta\)-greedy \(t\)-spanner
- The greedy spanner is existentially optimal
- Visualization of geometric spanner algorithms
- Distribution-sensitive construction of the greedy spanner
This page was built for publication: Distribution-sensitive construction of the greedy spanner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q527422)
