Approximation algorithms for finding maximum containing circle and sphere

DOI10.1016/J.TCS.2024.114901MaRDI QIDQ6652433zbMATH OpenFDO

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

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114901

zbMATH Keywords

approximation algorithmmaximum containing problemrectilinear polygon

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Enclosing weighted points with an almost-unit ball
• Covering Many or Few Points with Unit Disks
• Covering many or few points with unit disks
• On a circle placement problem
• An approximation algorithm for locating maximal disks within convex polygons

Cites work

• A (slightly) faster algorithm for klee's measure problem
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Covering many or few points with unit disks
• 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 4032498 (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
• Klee's measure problem on fat boxes in time \(\partial(n^{(d+2)/3})\)
• Near-linear time approximation schemes for geometric maximum coverage
• New Upper Bounds in Klee’s Measure Problem
• On a circle placement problem
• On Approximating the Depth and Related Problems
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Approximation algorithms for finding maximum containing circle and sphere

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