Author:
Mustafa Nabil H.,Dutta Kunal,Ghosh Arijit
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference33 articles.
1. N. Alon: A non-linear lower bound for planar epsilon-nets, Discrete & Computational Geometry
47 2012, 235–244.
2. B. Aronov, E. Ezra and M. Sharir: Small-size ϵ-nets for axis-parallel rectangles and boxes, SIAM Journal on Computing
39 2010, 3248–3282.
3. N. Bus, S. Garg, N. H. Mustafa and S. Ray: Tighter estimates for ϵ-nets for disks, Computational Geometry: Theory and Applications
53 2016, 27–35.
4. T. M. Chan, E. Grant, J. Könemann and M. Sharpe: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling, in: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1576–1585, 2012.
5. B. Chazelle: A note on Haussler's packing lemma, 1992, See Section 5.3 from Geometric Discrepancy: An Illustrated Guide by J. Matoušek.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deterministic Fault-Tolerant Connectivity Labeling Scheme;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
2. Hitting Sets when the Shallow Cell Complexity is Small;Approximation and Online Algorithms;2023
3. On KM-Fuzzy Metric Hypergraphs;Fuzzy Information and Engineering;2020-07-02
4. When are epsilon-nets small?;Journal of Computer and System Sciences;2020-06
5. The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg;Bulletin of the American Mathematical Society;2019-01-25