Prefix Sharing Is a Sorting Problem
A structure theorem: the minimum prefix-trie cost equals min_H sum_x w(x) t_x(H) over binary hierarchies H on the requests, where t_x(H) is the canonical decomposition size of the set of requests needing chunk x and choosing chunk orders is equivalent to choosing one hierarchy over requests.
Rong-Bei He
· 0 citations