Streaming diameter of high-dimensional points
From MaRDI portal
Cites work
- Approximate clustering via core-sets
- Approximate minimum enclosing balls in high dimensions using core-sets
- Approximating extent measures of points.
- Approximating the diameter of a set of points in the Euclidean space
- Clustering to minimize the maximum intercluster distance
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Geometric approximation algorithms
- High-dimensional geometric streaming in polynomial space
- scientific article; zbMATH DE number 2079383 (Why is no real title available?)
- scientific article; zbMATH DE number 2079414 (Why is no real title available?)
- scientific article; zbMATH DE number 6297803 (Why is no real title available?)
- Mergeable summaries
- Moderate dimension reduction for k-center clustering
- New streaming algorithms for high dimensional EMD and MST
- Non-adaptive adaptive sampling on turnstile streams
- Optimal core-sets for balls
- Reductions among high dimensional proximity problems
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Streaming algorithms for extent problems in high dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Streaming Euclidean MST to a constant factor
- Streaming facility location in high dimension via geometric hashing
This page was built for publication: Streaming diameter of high-dimensional points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322460)
