Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Approximating the Stretch Factor of Euclidean Graphs
SIAM Journal on Computing
Testing the diameter of graphs
Random Structures & Algorithms
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
SIAM Journal on Discrete Mathematics
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
SIAM Journal on Computing
Sublinear Geometric Algorithms
SIAM Journal on Computing
Geometric Spanner Networks
Computational Geometry: Theory and Applications
Lower bounds for testing Euclidean Minimum Spanning Trees
Information Processing Letters
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
Discrete & Computational Geometry
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Testing juntas nearly optimally
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
SIAM Journal on Computing
Dilation-optimal edge deletion in polygonal cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We develop a property testing algorithm with query complexity Õ(δ-5dε-5Dlog6 Δ√n) that tests whether a directed geometric graph G = (P, E) with maximum degree D and vertex set P ⊆ {1, ..., Δ}d (for constant d) is a Euclidean (1 + δ)-spanner. Such a property testing algorithm accepts every (1 + δ)-spanner and rejects with high constant probability every graph that is ε-far from this property, i. e., every graph that differs in more than ε|P| edges from every (1 + δ)-spanner.