4 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Danny Hucke
We prove a lower bound of Ω(log n/ log log n) on the approximation ratio of the global grammar-based compression algorithm Greedy. To our knowledge, the previously best lower bound…