Pages that link to "Item:Q1041786"
From MaRDI portal
The following pages link to Hitting sets when the VC-dimension is small (Q1041786):
Displaying 46 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Filtering algorithms for the NValue constraint (Q857887) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← 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)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Sharp concentration of hitting size for random set systems (Q2345531) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Analysis of a first-fit algorithm for the capacitated unit covering problem (Q4976332) (← links)
- Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- (Q5743501) (← links)
- Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. (Q5874550) (← links)
- Bregman Voronoi diagrams (Q5962350) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
- Hitting sets when the shallow cell complexity is small (Q6574945) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
