Algorithms of optimal covering of 2D sets with dynamical metrics

DOI10.35634/2226-3594-2022-60-04zbMATH Open1505.52018OpenAlexW4310548167MaRDI QIDQ5871398FDOQ5871398

Authors: P. D. Lebedev, Anna Anan'evna Lempert, Alexandr Leonidovich Kazakov 

Publication date: 19 January 2023

Published in: Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta (Search for Journal in Brave)

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

Recommendations

• On reserve and double covering problems for the sets with non-Euclidean metrics
• Algorithms of optimal set covering on the planar R^2
• On covering bounded sets by collections of circles of various radii
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Iterative methods for approximations constructing of optimal covering for nonconvex plane sets

zbMATH Keywords

wave frontChebyshev centeroptimal coveringdynamical metric

Mathematics Subject Classification ID

Dynamical systems in optimization and economics (37N40) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (3)

• On reserve and double covering problems for the sets with non-Euclidean metrics
• Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
• Algorithms of optimal set covering on the planar R^2

This page was built for publication: Algorithms of optimal covering of 2D sets with dynamical metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871398)