A simple and efficient method for accelerating construction of the gap-greedy spanner

DOI10.1142/S0129054123500119MaRDI QIDQ6554737zbMATH OpenFDO

Authors Hosein Salami, Mostafa Nouri-Baygi

Publication date 13 June 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123500119

zbMATH Keywords

gap greedygeometric spannerswell-separated pair decomposition

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Recommendations

• scientific article; zbMATH DE number 1617269
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Distribution-sensitive construction of the greedy spanner

Cites work

• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A framework for computing the greedy spanner
• An optimal algorithm for computing angle-constrained spanners
• Computing the greedy spanner in linear space
• Distribution-sensitive construction of the greedy spanner
• Efficient construction of a bounded-degree spanner with low weight
• Geometric Spanner Networks

This page was built for publication: A simple and efficient method for accelerating construction of the gap-greedy spanner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554737)