Pages that link to "Item:Q5390595"

The following pages link to Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes (Q5390595):

Displaying 44 items.

• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
• Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
• Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
• A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
• Small strong epsilon nets (Q396471) (← links)
• The class cover problem with boxes (Q419500) (← links)
• \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
• Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
• Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
• Geometric hitting set for segments of few orientations (Q1743112) (← links)
• Piercing axis-parallel boxes (Q1753044) (← links)
• Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
• On Wegner's inequality for axis-parallel rectangles (Q2005682) (← links)
• Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
• Small candidate set for translational pattern search (Q2088592) (← links)
• Piercing all translates of a set of axis-parallel rectangles (Q2115866) (← links)
• A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
• When are epsilon-nets small? (Q2304628) (← links)
• Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity (Q2340410) (← links)
• Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
• Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
• Constrained hitting set problem with intervals (Q2695330) (← links)
• Subsampling in Smoothed Range Spaces (Q2835631) (← links)
• A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
• Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
• Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
• On the number of points in general position in the plane (Q4645041) (← links)
• Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
• Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• (Q5091054) (← links)
• (Q5091247) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• An efficient container lemma (Q5144433) (← links)
• (Q5743501) (← links)
• Computing coverage kernels under restricted settings (Q5919535) (← links)
• Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)