DocumentCode
2384127
Title
The estimate for the cost of a search tree constructed on an arbitrary set of binary words
Author
Fedotov, Alexey ; Ryabko, Boris
Author_Institution
Dept. of Inf. Technol., Inst. of Comput. Technol., Novosibirsk, Russia
fYear
2000
fDate
2000
Firstpage
13
Abstract
Simple algorithm constructing search trees for the given set of binary words is presented. It is shown that the average cost of result of this algorithm, and, hence, the average cost of the optimum search tree is near to their natural lower bound
Keywords
information theory; tree searching; arbitrary set of binary words; cost estimation; information theory; natural lower bound; optimum search tree; Application software; Art; Binary search trees; Biology; Computer science; Cost function; Cybernetics; Electronic mail; Information technology; NP-hard problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866303
Filename
866303
Link To Document