Hardness of discrepancy computation and ε-net verification in high dimension

Journal of Complexity

Volumn 28, Issue 2, 2012, Pages 162-176

  Giannopoulos, Panos ^a   Knauer, Christian ^b   Wahlstrm, Magnus ^c   Werner, Daniel ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF BAYREUTH   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Discrepancy; Epsilon nets; Geometric dimension; Inapproximability; Parameterized complexity

Indexed keywords

CLUSTERING ALGORITHMS; GEOMETRY; HARDNESS;

DISCREPANCY; EPSILON-NETS; GEOMETRIC DIMENSIONS; INAPPROXIMABILITY; PARAMETERIZED COMPLEXITY;

PROBLEM SOLVING;

EID: 84858298108     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2011.09.001     Document Type: Article

References (27)

1. A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Symposium on Computational Geometry, 278290, 1987.
2. N. Alon, A non-linear lower bound for planar epsilon-nets, Discrete and Computational Geometry 2011 (in press) doi:10.1007/s00454-010-9323-7.
3. B. Aronov, and S. Har-Peled On approximating the depth and related problems SIAM J. Comput. 38 3 2008 899 921
4. J. Backer, J.M. Keil, The bichromatic rectangle problem in high dimensions, in: Proc. of the 21st Annual Canadian Conference on Computational Geometry, Vancouver, BC, Canada, pp. 157160, 2009.
5. J. Backer, J.M. Keil, The mono- and bichromatic empty rectangle and square problems in all dimensions, in: Proc. of the 9th Latin American Theoretical Informatics Symposium, vol. 6034, LNCS, pp. 1425, 2010.
6. S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, and G. Rote Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension ACM Transactions on Algorithms 7 4 2011 43:1 43:27
7. S. Cabello, P. Giannopoulos, C. Knauer, G. Rote, Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension, in: Proc. 19th Ann. ACM-SIAM Symposium on Discrete Algorithms, pp. 836843, 2008.
8. M. Cesati, and L. Trevisan On the efficiency of polynomial time approximation schemes Inf. Process. Lett. 64 4 1997 165 171 (Pubitemid 127397642)
9. B. Chazelle The Discrepancy Method: Randomness And Complexity 2000 Cambridge University Press
10. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I.A. Kanj, and G. Xia Tight lower bounds for certain parameterized NP-hard problems Inf. Comput. 201 2005 216 231 (Pubitemid 41240616)
11. D.P. Dobkin, D. Eppstein, and D.P. Mitchell Computing the discrepancy with applications to supersampling patterns ACM Trans. Graph. 15 4 1996 354 376 (Pubitemid 126418650)
12. B. Doerr, M. Gnewuch, and M. Wahlstrm Algorithmic construction of low-discrepancy point sets via dependent randomized rounding J. Complexity 26 5 2010 490 507
13. R.G. Downey, and M.R. Fellows Parameterized Complexity, Monographs in Computer Science 1999 Springer
14. M. Drmota, and R.F. Tichy Sequences, Discrepancies and Applications Lecture Notes in Mathematics vol. 1651 1997 Springer
15. A. Dumitrescu, and M. Jiang On the largest empty axis-parallel box amidst n points Computing Research Repository (CoRR) 2009 cs.CG
16. J. Eckstein, P.L. Hammer, Y. Liu, M. Nediak, and B. Simeone The maximum box problem and its application to data analysis Comput. Optim. Appl. 23 3 2002 285 298 (Pubitemid 35381600)
17. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
18. M. Gnewuch Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy J. Complexity 24 2 2008 154 172 (Pubitemid 351382119)
19. M. Gnewuch, A. Srivastav, and C. Winzen Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems J. Complexity 25 2009 115 127
20. D. Haussler, E. Welzl, Epsilon-nets and simplex range queries, in: Proc. of the 2nd Annual Symposium on Computational Geometry, ACM, pp. 6171, 1986.
21. J. Matouek Geometric Discrepancy: An Illustrated Guide 1999 Springer
22. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford University Press
23. H. Niederreiter Random Number Generation And Quasi-Monte Carlo Methods 1992 Society for Industrial and Applied Mathematics Philadelphia, PA, USA
24. J. Pach, G. Tardos, Tight lower bounds for the size of Epsilon-nets, in: Proc. of the 27th Annual ACM Symposium on Computational Geometry, ACM, pp. 458463, 2011.
25. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
26. E. Thimard An algorithm to compute bounds for the star discrepancy J. Complexity 17 4 2001 850 880
27. V.N. Vapnik, and A.Y. Chervonenkis On the uniform convergence of relative frequencies of events to their probabilities Theory of Probability and its Applications 16 2 1971 264 280