Algorithms of optimal set covering on the planar R^2
From MaRDI portal
Publication:5266487
DOI10.20537/vm160212zbMath1367.52015OpenAlexW2501761954MaRDI QIDQ5266487
V. N. Ushakov, Pavel Dmitrievich 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
Chebyshev centercharacteristic pointsoptimal coveringclosed curvedisk coveringDirichlet zonebest Chebyshev net
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Miscellaneous topics in calculus of variations and optimal control (49N99)
Related Items (4)
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 ball packing into ellipsoids ⋮ Unnamed Item
This page was built for publication: Algorithms of optimal set covering on the planar R^2
