Algorithms for constructing optimal \(n\)-networks in metric spaces

DOI10.1134/S0005117917070104zbMath1373.93092OpenAlexW2737285643MaRDI QIDQ1675840

Pavel Dmitrievich Lebedev, Aleksandr Leonidovich Kazakov

Publication date: 3 November 2017

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117917070104

zbMATH Keywords

metricVoronoi diagramChebyshev centeroptimal coveringDirichlet cellsoptimal Chebyshev network

Mathematics Subject Classification ID

Geometric methods (93B27)

Related Items

Chebyshev centres, Jung constants, and their applications ⋮ Methods of optimization of Hausdorff distance between convex rotating figures ⋮ On covering bounded sets by collections of circles of various radii ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of the Hausdorff distance between sets in Euclidean space
• Mathematical model and program system for solving a problem of logistic objects placement
• On segmenting logistical zones for servicing continuously developed consumers
• An approach to optimization in transport logistics
• Covering a rectangle with equal circles
• Covering a rectangle with six and seven circles
• Approximating sets on a plane with optimal sets of circles
• Algorithms of the best approximations of the flat sets by the union of circles
• Optimization of multiple covering of a bounded set with circles
• Multiple packings and coverings of the sphere
• ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES