3 code implementations • 9 Jul 2012 • Daniel Lemire, Owen Kaser, Eduardo Gutarra
For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived from traveling salesman heuristics, although there is a significant trade-off between running time and compression.
Databases H.4.0
