Dynamic coresets
From MaRDI portal
Publication:834605
DOI10.1007/s00454-009-9165-3zbMath1186.68558OpenAlexW4233454535MaRDI QIDQ834605
Publication date: 27 August 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9165-3
randomizationwidthapproximation algorithmsgeometric optimization\(k\)-centerdynamic data structuresword RAM
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Well-separated pair decomposition in linear time?
- Practical methods for shape fitting and kinetic data structures using coresets
- Clustering to minimize the maximum intercluster distance
- Maintenance of configurations in the plane
- Off-line dynamic maintenance of the width of a planar point set
- Preserving order in a forest in less than logarithmic time and linear space
- Line transversals of balls and smallest enclosing cylinders in three dimensions
- A fully dynamic algorithm for planar width
- Computing diameter in the streaming and sliding-window models
- Efficient randomized algorithms for some geometric optimization problems
- Clustering motion
- Dynamic half-space range reporting and its applications
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Approximating extent measures of points
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Equivalence between priority queues and sorting
- Approximate clustering via core-sets
- On coresets for k-means and k-median clustering
- Algorithms for dynamic geometric problems over data streams
- Coresets in dynamic geometric data streams
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
- A space-optimal data-stream algorithm for coresets in the plane
- On the convex layers of a planar set
- Decomposable searching problems I. Static-to-dynamic transformation
- ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE
- Projective clustering in high dimensions using core-sets
- Shape Fitting with Outliers
- Semi-Online Maintenance of Geometric Optima and Measures
- Approximation algorithms for projective clustering
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Robust shape fitting via peeling and grating coresets
This page was built for publication: Dynamic coresets
