Upper and lower bounds on constructing alphabetic binary trees

Authors:
Maria Klawe;Brendan Mumey
Affiliations:
Department of Computer Science, University of British Columbia, Vancouver, BC Canada V6T 1Z2;Department of Computer Science and Engineering, University of Washington, Seattle, WA
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Citing 3
Cited 1

Testing the optimality of alphabetic trees

Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

On the Huffman and alphabetic tree problem with general cost functions

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract