A novel approximation algorithm for max-covering circle problem

DOI10.1007/978-3-031-49611-0_16MaRDI QIDQ6606184

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

Publication date: 16 September 2024

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On enclosing k points by a circle
• Covering many or few points with unit disks
• On a circle placement problem
• Iterated nearest neighbors and finding minimal polytopes
• Computing the smallest \(k\)-enclosing circle and related problems
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Smallest \(k\)-enclosing rectangle revisited
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
• Improved Implementation of Point Location in General Two-Dimensional Subdivisions
• 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
• On Approximating the Depth and Related Problems
• Static and Dynamic Algorithms for k-Point Clustering Problems
• Probability Inequalities for Sums of Bounded Random Variables

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)