日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

Weak ε-nets have basis of size O(1/ε log (1/ε)) in any dimension

MPS-Authors
/persons/resource/persons45269

Ray,  Saurabh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45088

Mustafa,  Nabil H.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Ray, S., & Mustafa, N. H. (2007). Weak ε-nets have basis of size O(1/ε log (1/ε)) in any dimension. In Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07) (pp. 239-244). New York, NY: ACM. doi:10.1145/1247069.1247113.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-2135-0
要旨
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\epsilon$-nets for P. We show the following: pick a random sample Q of size O(1/$\epsilon$ log (1/$\epsilon$)) from P. Then, with constant probability, a weak $\epsilon$-net of P can be constructed from only the points of Q. This shows that weak $\epsilon$-nets in Rd can be computed from a subset of P of size O(1/$\epsilon$ log (1/$\epsilon$)) with only the constant of proportionality depending on the dimension, unlike all previous work where the size of the subset had the dimension in the exponent of 1/$\epsilon$. However, our final weak $\epsilon$-nets still have a large size (with the dimension appearing in the exponent of 1/$\epsilon$).