Covering weighted points using unit squares

DOI10.4230/LIPICS.ISAAC.2025.21MaRDI QIDQ7364361zbMATH OpenFDO

Authors Chaeyoon Chung, Jaegun Lee, Hee-Kap Ahn

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.21

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A threshold of ln n for approximating set cover
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• An analysis of approximations for maximizing submodular set functions—I
• Covering many or few points with unit disks
• Covering point sets with two disjoint disks or squares
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• scientific article; zbMATH DE number 1323125 (Why is no real title available?)
• Klee's measure problem made easy
• Near-linear time approximation schemes for geometric maximum coverage
• On the Complexity of Some Common Geometric Location Problems
• Placing two axis-parallel squares to maximize the number of enclosed points

This page was built for publication: Covering weighted points using unit squares

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