Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners

Authors:
Yefim Dinitz;Michael Elkin;Shay Solomon
Affiliations:
Ben-Gurion University of the Negev, Department of Computer Science, POB 653, 84105, Beer-Sheva, Israel;Ben-Gurion University of the Negev, Department of Computer Science, POB 653, 84105, Beer-Sheva, Israel;Ben-Gurion University of the Negev, Department of Computer Science, POB 653, 84105, Beer-Sheva, Israel
Venue:
Discrete & Computational Geometry
Year:
2010

Citing 0
Cited 2

Narrow-Shallow-Low-Light Trees with and without Steiner Points

SIAM Journal on Discrete Mathematics
Sparse Euclidean Spanners with Tiny Diameter

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent results have confirmed that the global rigidity of bar-and-joint frameworks on a graph G is a generic property in Euclidean spaces of all dimensions. Although it is not known if there is a deterministic algorithm that runs in polynomial ...