Alphabetic Tree Problem
A variant of the OBST problem is when only the gaps have nonzero access probabilities, and is called the optimal alphabetic tree problem.
Parameters
- : number of elements
Related Problems
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 3 of 3 algorithms
| See more | ||||
|---|---|---|---|---|
| Klawe; Mumey | 1993 | |||
| Garsia–Wachs algorithm | 1977 | |||
| Hu–Tucker algorithm | 1971 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table