Geometric spanner networks
By Giri Narasimhan, M. Smid. 2007
503 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/7a76abaae8c322f86935baaec68ef0c1eabff88a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Nicolás Emilio Bordenabe
- Konstantinos Chatzikokolakis
- Lester W. Mackey
- Jackson Gorham
- Catuscia Palamidessi
- Steven S. Skiena
- Qiang Liu
- Yang Song
Citations in the corpus
- Optimal Geo-Indistinguishable Mechanisms for Location Privacy (2014, methodology): “A crucial result presented in [16] is that, in the case where X is a set of points in the Euclidean plane, the degree of each node in the generated spanner only depends on the dilation factor:”
- The Algorithm Design Manual (2020, background): “[NS07] G. Narasimhan and M. Smid.”
- Measuring Sample Quality with Stein's Method (2015, methodology): “Q;G 1 ) S(Q;T P;G kk;Q;G t ) 3t2 S(Q;T P;G 1 ): Moreover, for any ‘ p norm, a 2-spanner with O( dn) edges can be computed in O( dnlog(n)) expected time for d a constant depending only on dand kk[18]. As a result, we will adopt a 2-spanner Stein discrepancy as our standard quality measure. 4.3 Decou”