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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 82; H. 6; S. 1675 - 1702
Hauptverfasser:	Avarikioti, Z., Emiris, I. Z., Kavouras, L., Psarros, I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2020 Springer Nature B.V Springer Verlag
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!