Algorithms of optimal set covering on the planar R^2
From MaRDI portal
Publication:5266487
Recommendations
- Algorithms of optimal covering of 2D sets with dynamical metrics
- Optimal algorithms for solving problems of arrangement and covering of plane polygonal figures
- An exact algorithm for a class of geometric set-cover problems
- Approximation algorithms for a geometric set cover problem
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
- Algorithms for the set covering problem
- Algorithmic aspects of regular graph covers with applications to planar graphs
- Exact and approximation algorithms for geometric and capacitated set cover problems
- Exact and approximation algorithms for geometric and capacitated set cover problems
- Algorithms for polytope covering and approximation
Cited in
(20)- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
- Optimal coverage of convex regions
- Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
- An exact algorithm for a class of geometric set-cover problems
- Algorithms of optimal covering of 2D sets with dynamical metrics
- On covering bounded sets by collections of circles of various radii
- Covering a set by a convex compactum: error estimates and computation
- Algorithms of the best approximations of the flat sets by the union of circles
- Algorithms for constructing optimal \(n\)-networks in metric spaces
- A branch-and-bound approach for estimating covering functionals of convex bodies
- Approximating sets on a plane with optimal sets of circles
- Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
- Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
- Algorithms of optimal ball packing into ellipsoids
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
- Covering a set of points with a minimum number of equal disks via simulated annealing
- Bounds on the optimal radius when covering a set with minimum radius identical disks
- A continuous set covering problem as a quasidifferentiable optimization problem
- Optimization of multiple covering of a bounded set with circles
This page was built for publication: Algorithms of optimal set covering on the planar R^2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266487)
