The following pages link to (Q5743501):
Displaying 44 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← 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)
- On the geometric set multicover problem (Q2167317) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- (Q5009574) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5089253) (← links)
- (Q5091054) (← links)
- (Q5091246) (← links)
- (Q5091247) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q5129231) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Covering segments with unit squares (Q5894547) (← links)
- Approximability of covering cells with line segments (Q5919568) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
- Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time (Q6139826) (← links)
