Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.29160

Approximation Algorithms for Geometric Maximum Coverage

Sujoy Bhore·Timothy M. Chan·Pasin Manurangsi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number $k$, select $k$ objects maximizing the number of points inside their union. - We present a polynomial-time approximation algorithm with approximation factor strictly better than $1-1/e$ for any set system with linear 2-shallow cell complexity (or any set system that can be decomposed into a constant number of such set systems). The result also holds for the weighted maximum coverage problem, where objects have weights and we want to select objects with total weight within a given budget. The result applies to many types of geometric objects, including pseudodisks in 2D, fat axis-aligned rectangles in 2D, similar-size fat triangles in 2D, axis-aligned unit cubes in 3D. - For small $k$, we obtain a $(1-ε)$-approximation algorithm more generally for any set system with constant VC dimension, running in time exponential in $\tilde{O}(k/ε)$. This simplifies and improves Badanidiyuru, Kleinberg, and Lee's parameterized approximation scheme [SoCG'12] running in time exponential in $\tilde{O}(k^2/ε^5)$. - A continuous version of the geometric maximum coverage problem asks for $k$ objects maximizing the volume of their union. We give better approximation algorithms for this problem for certain families of objects; e.g., we obtain an EPTAS for fat convex objects in any constant dimension. - We complement our algorithms with several hardness results, e.g., APX-hardness for fat axis-aligned rectangles in 2D, $(1-1/e+ε)$-approximation hardness for axis-aligned boxes in a dimension dependent on $ε$, and a lower bound ruling out $n^{\mathop{\rm poly}(1/ε)}$-time PTASs for the continuous problem for axis-aligned boxes in 3D.

Explore related subjects

cs.CGcs.CCcs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi. 2026-07-31. Approximation Algorithms for Geometric Maximum Coverage. https://arxiv.org/abs/2607.29160

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Stretch Factor of Planar Delaunay Triangulations Is Less Than 1.65

Delaunay triangulations are a fundamental class of plane spanners, and determining their worst-case stretch factor has been a longstanding problem in computational geometry. We prove an upper bound of \(1.65\), improving the bound of \(1.998\) due to Xia (2011) and reducing the gap to the known lower bound of \(1.5932\) by a factor of more than seven. Our proof works with the chains of circumdisks introduced by Xia, along which a path between two sites is assembled disk by disk. Xia measures such a path against a quantity attached to the whole chain, and because that quantity is not additive, his induction has to be carried alongside a separate global estimate. Our main idea is to measure the path against the progress it makes along the segment joining the two sites. This quantity is additive, so the bound becomes a Bellman recursion that forgets all but one number about the disks already passed, and we show that the bound holds if and only if a potential on the current state satisfies three local inequalities. The smallest feasible potential is the value function of that recursion, so searching for a potential becomes the problem of fitting this value function from above. The geometry of the disks reduces the fit to a linear program over functions of one variable, in which a GPT-based multi-agent system that we developed found a feasible point, certified in exact arithmetic.

cs.CG↗
arXiv2026

Fast Persistent Homology Computation for Functions on $\mathbb{R}$

0-dimensional persistent homology is known, from a computational point of view, as the easy case. Indeed, given a list of $n$ edges in non-decreasing order of filtration value, one only needs a union-find data structure to keep track of the connected components and we get the persistence diagram in time $O(nα(n))$. The running time is thus usually dominated by sorting the edges in $Θ(n\log(n))$. A little-known fact is that, in the particularly simple case of studying the sublevel sets of a piecewise-linear function on $\mathbb{R}$ or $\mathbb{S}^1$, persistence can actually be computed in linear time. This note presents a simple algorithm that achieves this complexity and an extension to image persistence. An implementation is available in Gudhi.

cs.CG↗
arXiv2026

Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model

In this work, we present a computational model to investigate transdermal insulin delivery using coated microneedles. A detailed skin geometry incorporating a coated microneedles was developed to analyze insulin release through the different skin layers and to evaluate the influence of key transport parameters. The model represents the major skin layers: the stratum corneum, viable epidermis, and dermis. Unstructured grids were used to achieve a reliable resolution of the model. The simulations provide insights into the permeation of insulin from the coated microneedles and the transport and distribution across the different skin layers. Finally, the simulation results were compared with experimental data to evaluate the predictive capability of the model.

cs.CG↗