In this paper, such an algorithm is proposed. The new algorithm works under the dynamic programming framework and runs in provably linear time for multiple buffer types due to two novel techniques: restrictive cost bucketing and efficient delay update. Experiment results on industrial netlists demonstrate that the new algorithm consistently outperforms van Ginneken/Lillis algorithm [1], [2] for RC buffering and all known RLC buffering algorithms. Without buffer cost minimization, the new algorithm saves up to 8.5% buffer area and provides up to 4? speedup over Ismail?s algorithm [3]. When buffer cost minimization is handled, the new algorithm uses 33.4% fewer buffers than van Ginnenken- Lillis?s algorithm, and saves up to 5.3% buffer area and gives up to 5? speedup compared to the algorithm in [4].