Approximating Euclidean distances by small degree graphs
From MaRDI portal
(Redirected from Publication:1317879)
Recommendations
Cites work
- scientific article; zbMATH DE number 4155926 (Why is no real title available?)
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Classes of graphs which approximate the complete Euclidean graph
- Delaunay graphs are almost as good as complete graphs
- Generating sparse spanners for weighted graphs
- Graph spanners
- On sparse spanners of weighted graphs
- The Closest Packing of Spherical Caps in n Dimensions
Cited in
(11)- \( \delta \)-greedy \(t\)-spanner
- scientific article; zbMATH DE number 4070353 (Why is no real title available?)
- scientific article; zbMATH DE number 910877 (Why is no real title available?)
- Computing the greedy spanner in near-quadratic time
- Spanners under the Hausdorff and Fréchet distances
- Spanners in randomly weighted graphs: Euclidean case
- On the relation between graph distance and Euclidean distance in random geometric graphs
- Euclidean spanner graphs with degree four
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Euclidean spanners in high dimensions
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
This page was built for publication: Approximating Euclidean distances by small degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317879)