Lower bound for sparse Euclidean spanners

MaRDI QIDQ2921726zbMATH OpenFDO

Authors Yusu Wang, Peng Yin, Pankaj K. Agarwal

Publication date 13 October 2014

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Low-light trees, and tight lower bounds for Euclidean spanners
• On sparse spanners of weighted graphs
• On Spanners of Geometric Graphs
• scientific article; zbMATH DE number 1263225
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS

Cited in

(12)

• Sparse Euclidean Spanners with Tiny Diameter
• Optimal Euclidean Spanners
• Testing Euclidean Spanners
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Error Amplification for Pairwise Spanner Lower Bounds
• Truly Optimal Euclidean Spanners
• scientific article; zbMATH DE number 7238981 (Why is no real title available?)
• Minimum weight Euclidean (1+)-spanners
• Minimum weight Euclidean \((1+\varepsilon)\)-spanners
• Truly optimal Euclidean spanners
• Low-light trees, and tight lower bounds for Euclidean spanners

This page was built for publication: Lower bound for sparse Euclidean spanners

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