Faster core-set constructions and data stream algorithms in fixed dimensions

DOI10.1145/997817.997843zbMath1377.68322OpenAlexW2084448578MaRDI QIDQ5361667

Timothy M. Chan

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997843

zbMATH Keywords

approximation algorithmsdata streamsgeometric optimization problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (5)

Efficiently approximating color-spanning balls ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Adaptive sampling for geometric problems over data streams ⋮ Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets ⋮ Minimum-volume enclosing ellipsoids and core sets

This page was built for publication: Faster core-set constructions and data stream algorithms in fixed dimensions