High-Dimensional Approximate r-Nets

The construction of r -nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate r -nets with respect to Euclidean distance. For any fixed ϵ > 0 , the approximation factor is...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 82; no. 6; pp. 1675 - 1702
Main Authors:	Avarikioti, Z., Emiris, I. Z., Kavouras, L., Psarros, I.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2020 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Clustering Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Euclidean geometry Geometry Mathematics Mathematics of Computing Metric Geometry Metric space Polynomials Software Theory of Computation General dimension Locality sensitive hashing Approximation algorithm nets Metric geometry
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!