Exact algorithms and APX-hardness results for geo- metric packing and covering problems. Computational Geometry, 47(2):112-124, 2014.T. M. Chan and E. Grant. Exact algorithms and APX-hardness results for geometric packing and covering problems. Computational Geometry, 47(2):112-124, 2014....
APX-hardApproximationk-BurningConsider an information diffusion process on a graph G that starts with \\(k>0\\) burnt vertices, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as k other unburnt vertices. The k-burning number of G is the minimum...