Author

Timothy M. Chan

h-index 4 View on Semantic Scholar

We have 1 of 6 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

Approximation Algorithms for Geometric Maximum Coverage

A polynomial-time approximation algorithm with approximation factor strictly better than $1-1/e$ for any set system with linear 2-shallow cell complexity and any set system that can be decomposed into a constant number of such set systems is presented.

S. Bhore, Timothy M. Chan, Pasin Manurangsi · arXiv.org · 0 citations