On the Thinnest Covering of Fixed Size Containers with Non-euclidean Metric by Incongruent Circles
Авторы: Kazakov A., Lempert A., Le Q.M.
Журнал: Communications in Computer and Information Science: Proc. of the Intern. Conf. on Mathematical Optimization Theory and Operations Research (MOTOR'2019)
Отчётный год: 2019
Аннотация: The paper is devoted to the circle covering problem with unequal circles. The number of circles is given. Also, we know a function, which determines a relation between the radii of two neighboring circles. The circle covering problem is usually studied in the case when the distance between points is Euclidean. We assume that the distance is determined by means of some special metric, which, generally speaking, is not Euclidean. The special numerical algorithm is suggested and implemented. It based on optical-geometric approach, which is developed by the authors in recent years and previously used only for circles of the equal radius. The results of a computational experiment are presented and discussed.
Индексируется WOS: 1
Индексируется Scopus: 1
Индексируется РИНЦ: 0
Публикация в печати: 0
Добавил в систему: