Algorithms of optimal set covering on the planar R^2

DOI10.20537/VM160212zbMATH Open1367.52015OpenAlexW2501761954MaRDI QIDQ5266487FDOQ5266487

Authors: Vladimir N. Ushakov, P. D. Lebedev 

Publication date: 6 June 2017

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/vuu537

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

zbMATH Keywords

Chebyshev centercharacteristic pointsoptimal coveringclosed curvedisk coveringDirichlet zonebest Chebyshev net

Mathematics Subject Classification ID

Miscellaneous topics in calculus of variations and optimal control (49N99) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (20)

• Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
• A continuous set covering problem as a quasidifferentiable optimization problem
• Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
• Algorithms of optimal covering of 2D sets with dynamical metrics
• Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
• Approximating sets on a plane with optimal sets of circles
• Bounds on the optimal radius when covering a set with minimum radius identical disks
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
• Covering a set by a convex compactum: error estimates and computation
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Algorithms of the best approximations of the flat sets by the union of circles
• Optimization of multiple covering of a bounded set with circles
• Covering a set of points with a minimum number of equal disks via simulated annealing
• On covering bounded sets by collections of circles of various radii
• Optimal coverage of convex regions
• Algorithms of optimal ball packing into ellipsoids
• A branch-and-bound approach for estimating covering functionals of convex bodies
• Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
• An exact algorithm for a class of geometric set-cover problems

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)