Timothy M. Chan

activity

20242026

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2026

Approximation Algorithms for Geometric Maximum Coverage

Sujoy Bhore, Timothy M. Chan, Pasin Manurangsi

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 po…

cs.CG2025

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs

Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang +2

We present new results on $2$ - and $3$ -hop spanners for geometric intersection graphs. These include improved upper and lower bounds for $2$ - and $3$ -hop spanners for many geometri…

cs.CG2024

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching

Sujoy Bhore, Timothy M. Chan

We develop simple and general techniques to obtain faster (near-linear time) static approximation algorithms, as well as efficient dynamic data structures, for four fundamental geo…