In computational geometry, a coreset is a small set of points that approximates the shape of a larger point set, in the sense that applying some geometric measure to the two sets (such as their minimum bounding box volume) results in approximately equal numbers. Many natural geometric optimization problems have coresets that approximate an optimal solution to within a factor of 1 + ε, that can be found quickly (in linear time or near-linear time), and that have size bounded by a function of 1/ε independent of the input size, where ε is an arbitrary positive number. When this is the case, one obtains a linear-time or near-linear time approximation scheme, based on the idea of finding a coreset and then applying an exact optimization algorithm to the coreset. Regardless of how slow the exact optimization algorithm is, for any fixed choice of ε, the running time of this approximation scheme will be O(1) plus the time to find the coreset.[1][2]
References edit
- ^ Agarwal, Pankaj K.; Har-Peled, Sariel; Varadarajan, Kasturi R. (2005), "Geometric approximation via coresets", in Goodman, Jacob E.; Pach, János; Welzl, Emo (eds.), Combinatorial and Computational Geometry, Mathematical Sciences Research Institute Publications, vol. 52, Cambridge Univ. Press, Cambridge, pp. 1–30, MR 2178310.
- ^ Nielsen, Frank (2016). "10. Fast approximate optimization in high dimensions with core-sets and fast dimension reduction". Introduction to HPC with MPI for Data Science. Springer. pp. 259–272. ISBN 978-3-319-21903-5.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |