scientific article; zbMATH DE number 3162350
From MaRDI portal
Publication:3280457
Cited in
(9)- The \(S\)-digraph optimization problem and the greedy algorithm
- Finite codes and groupoid words
- Optimal point-to-point broadcast algorithms via lopsided trees
- Prefix codes: equiprobable words, unequal letter costs
- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
- Approximation Algorithms for Key Management in Secure Multicast
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
- An approximation algorithm for binary searching in trees
- Dynamic Shannon coding
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3280457)
