Pages that link to "Item:Q3451756"
From MaRDI portal
The following pages link to Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756):
Displaying 20 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← 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)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- (Q5009574) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Planar Support for Non-piercing Regions and Applications (Q5009639) (← links)
- Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice (Q5031618) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5111691) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
