The input/output complexity of sorting and related problems
Communications of the ACM
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Optimally sparse spanners in 3-dimensional Euclidean space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dealing with higher dimensions: the well-separated pair decomposition and its applications
Dealing with higher dimensions: the well-separated pair decomposition and its applications
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for computing geometric spanners and approximate shortest paths
Discrete Applied Mathematics
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
t-Spanners as a Data Structure for Metric Space Searching
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
External memory data structures
Handbook of massive data sets
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Randomized and deterministic algorithms for geometric spanners of small diameter
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given a geometric graph G=(S,E) in ${\mathbb R}^{d}$ with constant dilation t, and a positive constant ε, we show how to construct a (1+ε)-spanner of G with ${\mathcal O}(|S|)$ edges using ${\mathcal O}(sort(|E|))I/O$ I/O operations.