#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1997

1999

#### Co-author

#### Publication Venue

Learn More

- Douglas Stott Parker, Prasad Ram
- SIAM J. Comput.
- 1999

We show that the space of all binary Huffman codes for a finite alphabet defines a lattice, ordered by the imbalance of the code trees. Representing code trees as path-length sequences, we show that the imbalance ordering is closely related to a majorization ordering on real-valued sequences that correspond to discrete probability density functions.… (More)

We present a straightforward linear algebraic model of greed, based only on extensions of classical majorization and convexity theory. This gives an alternative to other models of greedy-solvable problems such as matroids, greedoids, submodular functions, etc., and it is able to express established examples of greedy-solvable optimization problems that they… (More)

Majorization is an important partial order on multisets. Since its development at the turn of the twentieth century by economists formalizing the notion ofèxchange' among distributions, it has found applications ranging from stochastic scheduling to singular value theory. In this paper we reconstruct majorization as a partial order on vectors (ordered… (More)

- ‹
- 1
- ›