A method for proving lower bounds for the 2-limited broadcast domination number on grid graphs

We establish lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular the Cartesian product of two paths, a path and a cycle, and two cycles. Our lower bounds are derived by computational techniques. Some of the lower bounds are periodically best possible, and yield exact values.