Pages that link to "Item:Q5115815"
From MaRDI portal
The following pages link to On Partial Covering For Geometric Set Systems (Q5115815):
Displaying 19 items.
- A unified approach to approximating partial covering problems (Q633845) (← links)
- On the positive-negative partial set cover problem (Q975452) (← links)
- Overlarge sets and partial geometries (Q1375942) (← 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)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Minimum power partial multi-cover on a line (Q2661770) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- (Q4208235) (← links)
- Geometric Set Cover and Hitting Sets for Polytopes in R (Q4910744) (← links)
- (Q5075746) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- On approximating partial scenario set cover (Q6652422) (← links)