Better algorithms for high-dimensional proximity problems via asymmetric embeddings
Piotr Indyk
Proc. 14th Symp. Discrete Algorithms
,
ACM
and
SIAM
,
Jan 2003, pp. 539–545
Cites:
Dynamic Euclidean minimum spanning trees and extrema of binary functions
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
