@inproceedings{e969273e7cfa440cbd8b2ae1274e9829,

title = "Sequential optimization of binary search trees for multiple cost functions",

abstract = "In this paper, we present a methodology to model the optimal binary search tree problem as a directed acyclic graph to extract all possible optimal solutions. We provide a mechanism to find optimal binary search trees relative to different types of cost functions, sequentially. We prove that for a set of n keys our optimization procedure makes O(n 3) arithmetic operations per cost function such as weighted depth or average weighted depth.",

keywords = "Binary search trees, Cost functions, Dynamic programming, Sequential optimization",

author = "Maram Alnafie and Igor Chikalov and Shahid Hussain and Mikhail Moshkov",

year = "2011",

language = "English (US)",

isbn = "9781920682989",

series = "Conferences in Research and Practice in Information Technology Series",

pages = "41--44",

booktitle = "Theory of Computing 2011 - Proceedings of the 17th Computing",

note = "Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 ; Conference date: 17-01-2011 Through 20-01-2011",

}