On covering bounded sets by collections of circles of various radii

DOI10.26516/1997-7670.2020.31.18zbMath1444.90076OpenAlexW3010828364MaRDI QIDQ2307921

Pavel Dmitrievich Lebedev, Aleksandr Leonidovich Kazakov, Anna Anan'evna Lempert

Publication date: 25 March 2020

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathizv.isu.ru/en/article/file?id=1328

zbMATH Keywords

iterative algorithmcircle covering problemgeneralized Dirichlet zone

Mathematics Subject Classification ID

Continuous location (90B85) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical model and program system for solving a problem of logistic objects placement
• Optimal circle covering problems and their applications
• An intelligent management system for the development of a regional transport logistics infrastructure
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Thinnest covering of the Euclidean plane with incongruent circles
• Covering the plane with two kinds of circles
• Solid coverings of the Euclidean plane with incongruent circles
• On reserve and double covering problems for the sets with non-Euclidean metrics

This page was built for publication: On covering bounded sets by collections of circles of various radii