Pages that link to "Item:Q2030243"
From MaRDI portal
The following pages link to An exact algorithm for a class of geometric set-cover problems (Q2030243):
Displaying 12 items.
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- Disc covering problem with application to digital halftoning (Q970100) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
- An exact algorithm for the maximal covering problem (Q4883162) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- Covering a set of points with a minimum number of equal disks via simulated annealing (Q6097195) (← links)
- The Exact Subset MultiCover problem (Q6111957) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
