Sparse Euclidean Spanners with Tiny Diameter

DOI10.1145/2483699.2483708MaRDI QIDQ2933658zbMATH OpenOpenAlexFDO

Authors Shay Solomon

Publication date 5 December 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2483699.2483708

zbMATH Keywords

diametergraph spannersEuclidean spannersEuclidean metrics

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12)

Recommendations

• An optimal-time construction of sparse Euclidean spanners with tiny diameter
• Lower bound for sparse Euclidean spanners
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Euclidean spanners in high dimensions
• Small hop-diameter sparse spanners for doubling metrics
• Optimal Euclidean Spanners
• Euclidean Steiner spanners: light and sparse
• Optimal Euclidean spanners, really short, thin and lanky
• scientific article; zbMATH DE number 1263225

Cited in

(7)

• An optimal-time construction of sparse Euclidean spanners with tiny diameter
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• Sparse Euclidean spanners with optimal diameter: a general and robust lower bound via a concave inverse-Ackermann function
• Optimal Euclidean Spanners
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Testing Euclidean Spanners
• Sparse Euclidean spanners with tiny diameter: a tight lower bound

This page was built for publication: Sparse Euclidean Spanners with Tiny Diameter

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