Approximation algorithms for finding maximum containing circle and sphere

DOI10.1016/j.tcs.2024.114901MaRDI QIDQ6652433

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

Publication date: 12 December 2024

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

zbMATH Keywords

approximation algorithmrectilinear polygonmaximum containing problem

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering many or few points with unit disks
• On a circle placement problem
• Near-linear time approximation schemes for geometric maximum coverage
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Improved Implementation of Point Location in General Two-Dimensional Subdivisions
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• A (slightly) faster algorithm for klee's measure problem
• On Approximating the Depth and Related Problems
• New Upper Bounds in Klee’s Measure Problem
• Probability Inequalities for Sums of Bounded Random Variables
• Klee's measure problem on fat boxes in time ∂( n ^{( d +2)/3} )

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