Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
Mordecai Golin, Claire Mathieu, Neal E. Young
Abstract
We give a polynomial-time approximation scheme for the generalization of Huffman Coding in which codeword letters have non-uniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a (1+epsilon)-approximate solution in time O(n + f(epsilon) log3 n), where n is the input size.
Create a lesson
Related papers
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk
Deterministic Girth Approximation in Weighted Undirected Graphs
Avi Kadria
Polynomial directed treewidth forces a large bramble with congestion two
Victor A. Campos, Raul Lopes, Rodrigo Nogueira et al.
Minimizing fuzzy Kripke models over residuated lattices
Linh Anh Nguyen