Epsilon-approximations and epsilon-nets

MaRDI QIDQ6283087zbMATH OpenFDO

Authors Nabil H. Mustafa, Kasturi Varadarajan

Publication date 13 February 2017

Abstract: The use of random samples to approximate properties of geometric configurations has been an influential idea for both combinatorial and algorithmic purposes. This chapter considers two related notions---$epsilon$-approximations and $epsilon$-nets---that capture the most important quantitative properties that one would expect from a random sample with respect to an underlying geometric configuration.

This page was built for publication: Epsilon-approximations and epsilon-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283087)