Hardness of discrepancy computation and ε-net verification in high dimension
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2012/04/01
-
Journal
-
Indian UGC (journal)
-
Refrences27
-
Citations10
-
Panos Giannopoulos
-
Christian Knauer
-
Magnus Wahlström
-
Daniel Werner
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
- On calculating with B-splines
- A strong convergence theorem for relatively nonexpansive mappings in a Banach space
- Fractal Functions and Wavelet Expansions Based on Several Scaling Functions
- A Simple Proof of the Restricted Isometry Property for Random Matrices
- On Early Stopping in Gradient Descent Learning
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Geometric clustering | ACM Transactions on Algorithms |
| 5 | 2011 |
| Algorithmic construction of low-discrepancy point sets via dependent randomized rounding | Journal of Complexity |
| 11 | 2010 |
| On Approximating the Depth and Related Problems | SIAM Journal on Computing |
| 41 | 2008 |
| Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy | Journal of Complexity |
| 25 | 2008 |
| The maximum box problem and its application to data analysis | Computational Optimization and Applications |
| 2002 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Heuristic approaches to obtain low-discrepancy point sets via subset selection | Journal of Complexity |
| 2024 | |
| Faster Algorithms for Largest Empty Rectangles and Boxes | Discrete & Computational Geometry |
| 2023 | |
| Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions | Journal of Complexity |
| 1 | 2022 |
| An enumerative formula for the spherical cap discrepancy | Journal of Computational and Applied Mathematics |
| 2021 | |
| Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples | The Annals of Applied Probability |
| 1 | 2021 |
Citations Analysis
The category
Science: Mathematics 8
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting and was published in 2012. The most recent citation comes from a 2024 study titled Heuristic approaches to obtain low-discrepancy point sets via subset selection. This article reached its peak citation in 2021, with 2 citations. It has been cited in 7 different journals. Among related journals, the Journal of Complexity cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.