Algorithms for constructing optimal \(n\)-networks in metric spaces
type: Item
instance of: scholarly article
title: Algorithms for constructing optimal \(n\)-networks in metric spaces
zbMATH Open document ID: 1373.93092
DOI: 10.1134/S0005117917070104
published in: Automation and Remote Control
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 93B27
zbMATH DE Number: 6802688
zbMATH Keywords: optimal Chebyshev network
zbMATH Keywords: optimal covering
zbMATH Keywords: Chebyshev center
zbMATH Keywords: metric
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: Dirichlet cells
author: Alexandr Leonidovich Kazakov
author: P. D. Lebedev
MaRDI profile type: Publication
cites work: Q3992847
cites work: The approximation of reachable domains of control systems
cites work: Q3843864
cites work: Approximating sets on a plane with optimal sets of circles
cites work: Algorithms of the best approximations of the flat sets by the union of circles
cites work: Optimization of the Hausdorff distance between sets in Euclidean space
cites work: An approach to optimization in transport logistics
cites work: On segmenting logistical zones for servicing continuously developed consumers
cites work: ENERGY-EFFICIENT NODE SCHEDULING MODELS IN SENSOR NETWORKS WITH ADJUSTABLE RANGES
cites work: Q3001510
cites work: Q5592827
cites work: Covering a rectangle with equal circles
cites work: Covering a rectangle with six and seven circles
cites work: Optimization of multiple covering of a bounded set with circles
cites work: Multiple packings and coverings of the sphere
cites work: Mathematical model and program system for solving a problem of logistic objects placement
full work available at URL: s0005117917070104
OpenAlex ID: W2737285643
description: scientific article; zbMATH DE number 6802688