T. C. Hu

Optimal Computer Search Trees and Variable-Length Alphabetical Codes

An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs

Optimum Communication Spanning Trees

4n^2 + 2n

Generating Binary Trees Lexicographically

operations and

BINARY TREES OPTIMUM UNDER VARIOUS CRITERIA

4n

Optimal robust path planning in general environments

storage locations, where n is the number of terminal nodes in the tree. A given binary tree corresponds to a computer search procedure, where the given files or letters (represented by terminal nodes) are partitioned into two parts successively until a particular file or letter is finally identified. If the files or letters are listed alphabetically, such as a dictionary, then the binary tree must have, from left to right, the terminal nodes consecutively. Since different letters have different frequencies (weights) of occurring, an alphabetic tree of minimum weighted path length corresponds to a computer search tree with minimum-mean search time. A binary tree also represents a (variable-length) binary code. In an alphabetic binary code, the numerical binary order of the code words corresponds to the alphabetical orde...

Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods

Given a set of nodes

A Decomposition Algorithm for Shortest Paths in a Network

N_i (i = 1,2, \cdots ,n)

Optimization of globally convex functions

which may represent cities and a set of requirements

A replication cut for two-way partitioning

r_{ij}

Computation of matrix chain products. Part II

which may represent the number of telephone calls between