Algorithms of optimal set covering on the planar R^2

DOI10.20537/VM160212zbMATH Open1367.52015OpenAlexW2501761954MaRDI QIDQ5266487FDOQ5266487

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

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 (8)

• Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
• 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
• Title not available (Why is that?)
• 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
• Algorithms of optimal ball packing into ellipsoids
• A branch-and-bound approach for estimating covering functionals of convex bodies

   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 👍 👎

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)