A novel approximation algorithm for max-covering circle problem

DOI10.1007/978-3-031-49611-0_16MaRDI QIDQ6606184zbMATH OpenFDO

Authors Kaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_16

zbMATH Keywords

\( \left( 1-\varepsilon \right)\) approximationmax-covering problemsymmetrical rectilinear polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Computing the smallest k-enclosing circle and related problems
• Covering many or few points with unit disks
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
• Finding k points with minimum diameter and related problems
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improved implementation of point location in general two-dimensional subdivisions
• Iterated nearest neighbors and finding minimal polytopes
• On a circle placement problem
• On Approximating the Depth and Related Problems
• On enclosing k points by a circle
• Probability Inequalities for Sums of Bounded Random Variables
• Smallest \(k\)-enclosing rectangle revisited
• Static and Dynamic Algorithms for k-Point Clustering Problems

This page was built for publication: A novel approximation algorithm for max-covering circle problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606184)