An Optimal Density Bound for Discretized Point Patrolling
Ahan Mishra
Published in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026
This paper proves an optimal theoretical bound for discretized point patrolling as well as am improved algorithm for bamboo garden trimming, with extensible techniques in both cases.
