A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem |
| |
Institution: | Faculty of Military Sciences, Netherlands Defence Academy, Den Helder, the Netherlands |
| |
Abstract: | 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 zero. The goal in BGT is to make a perpetual schedule of cuts such that the height of the tallest bamboo ever is minimized. Here, we improve the current best approximation guarantee by designing a 12/7-approximation algorithm. |
| |
Keywords: | Bamboo Garden Trimming Pinwheel scheduling Approximation algorithms |
本文献已被 ScienceDirect 等数据库收录! |
|