2 papers
cs.DS2020
A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem
Martijn van Ee
We study the discrete Bamboo Garden Trimming problem (BGT), where we are given n bamboos with different growth rates. At the end of each day, one can cut down one bamboo to height…
cs.DS2017
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
Thomas Bosman, Martijn van Ee, Yang Jiao +3
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the lit…