scientific article; zbMATH DE number 7561580

DOI10.4230/LIPIcs.ICALP.2019.87MaRDI QIDQ5091247

Nabil H. Mustafa

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

geometric set systems\(\varepsilon\)-nets

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tighter estimates for \(\epsilon\)-nets for disks
• A simple proof of the shallow packing lemma
• Practical methods for shape fitting and kinetic data structures using coresets
• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• Reporting points in halfspaces
• A simple proof of optimal epsilon nets
• Applications of random sampling in computational geometry. II
• Weighted geometric set cover via quasi-uniform sampling
• A Randomized Algorithm for Closest-Point Queries
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
• Improved approximation algorithms for geometric set cover
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
• Geometric discrepancy. An illustrated guide

This page was built for publication: