Author： Llanas Bernardo
Publisher： Springer Publishing Company
ISSN： 0926-6003
Source： Computational Optimization and Applications, Vol.30, Iss.2, 2005-02, pp. : 161-194
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, a simple yet efficient randomized algorithm (Exterior Random Covering) for finding the maximum distance from a point set to an arbitrary compact set in
Related content
Access to resources
Recommend
Volumes of symmetric random polytopes
By Meckes M. W.
Archiv der Mathematik, Vol. 82, Iss. 1, 2004-01 ,pp. :
On the Hausdorff Dimension of Some Random Cantor Sets
Lithuanian Mathematical Journal, Vol. 43, Iss. 2, 2003-04 ,pp. :
The Hausdorff dimension of some random invariant graphs
Nonlinearity, Vol. 25, Iss. 3, 2012-03 ,pp. :