A new genetic approach to construct near-optimal binary search trees

DOI10.1016/j.amc.2007.02.052zbMath1117.92045OpenAlexW2153397699MaRDI QIDQ2383896

Afsaneh Fatemi, Naser NematBakhsh, Kamran Zamanifar

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.052

zbMATH Keywords

optimizationgenetic algorithmnear-optimal binary search tree

Mathematics Subject Classification ID

Problems related to evolution (92D15) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to biology (92-04) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

Evolutionary design of oriented-tree networks using Cayley-type encodings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal alphabetic search trees with restricted maximal height
• Nearly optimal binary search trees
• Optimal binary search trees with costs depending on the access paths.
• Optimum binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Optimal Alphabetic Trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Algorithms and Computation
• Optimal binary search trees

This page was built for publication: A new genetic approach to construct near-optimal binary search trees