Pages that link to "Item:Q1906049"
From MaRDI portal
The following pages link to Almost optimal set covers in finite VC-dimension (Q1906049):
Displaying 50 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Polygon guarding with orientation (Q340539) (← 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)
- Computing cup products in \(\mathbb{Z}_2\)-cohomology of 3D polyhedral complexes (Q404268) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Optimal partition trees (Q420575) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Approximately dominating representatives (Q870264) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Covering a line segment with variable radius discs (Q960389) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409) (← links)
- Hitting sets when the VC-dimension is small (Q1041786) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- The VC-dimension of visibility on the boundary of monotone polygons (Q1630914) (← links)
- Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- Greedy domination on biclique-free graphs (Q1730031) (← links)
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- On the establishment of distinct identities in overlay networks (Q1954205) (← links)
- On separating points by lines (Q1985301) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- The maximum exposure problem (Q2123293) (← links)
- Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
