Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set

DOI10.1134/S0965542519040031OpenAlexW2952124005MaRDI QIDQ2332657

A. V. Khorkov, Sh. I. Galiev

Publication date: 4 November 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

multiple coverings\(k\)-covering with circles of two radiiestimation of density of a \(k\)-covering with circles of two radii

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solution of the \(p\)-median minimization problem
• Challenges and opportunities of connected \(k\)-covered wireless sensor networks. From sensor deployment to data gathering
• Improved coverings of a square with six and eight equal circles
• Rounding algorithms for covering problems
• On the complexity of asymptotically optimal coverings and packings
• Covering the plane with two kinds of circles
• Covering a square by equal circles
• Covering a rectangle with six and seven circles
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• The minimum equitable radius location problem with continuous demand
• Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
• Optimization of multiple covering of a bounded set with circles
• Multiple packing and covering of the plane with circles
• Covering Polygons Is Hard
• Grid coverage for surveillance and target location in distributed sensor networks
• Loosest Circle Coverings of an Equilateral Triangle
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

This page was built for publication: Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set