There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Minimum spanning trees in k-dimensional space
SIAM Journal on Computing
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Delaunay graphs are almost as good as complete graphs
Discrete & Computational Geometry
Generating sparse spanners for weighted graphs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Proceedings of the international symposium on Optimal algorithms
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Fast expected-time and approximation algorithms for geometric minimum spanning trees
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
The MST of symmetric disk graphs (in arbitrary metric spaces) is light
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
Hi-index | 0.00 |