-greedy t-spanner

DOI10.1016/J.COMGEO.2021.101807OpenAlexW2593488756MaRDI QIDQ824327FDOQ824327

Authors: A. Karim Abu-Affash, Gali Bar-On, Paz Carmi 

Publication date: 15 December 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2021.101807

zbMATH Keywords

computational geometrygeometric spannerspath-greedy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Cites Work

• Geometric Spanner Networks
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Computing the Greedy Spanner in Near-Quadratic Time
• Title not available (Why is that?)
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• Computing the greedy spanner in linear space
• Approximating Euclidean distances by small degree graphs
• Constructing sparse spanners for most graphs in higher dimensions
• Experimental study of geometric \(t\)-spanners
• Experimental Study of Geometric t-Spanners: A Running Time Comparison
• Algorithms – ESA 2005
• Improved algorithms for constructing fault-tolerant spanners

Cited In (2)

• Minimum weight Euclidean \((1+\varepsilon)\)-spanners
• Minimum weight Euclidean \((1+\varepsilon)\)-spanners

This page was built for publication: \( \delta \)-greedy \(t\)-spanner

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