A counter example to a monotonicity property of k-d trees

DOI10.1016/0020-0190(82)90099-0zbMath0533.68066OpenAlexW2015488612MaRDI QIDQ789903

Toshitsugu Yuba, Mamoru Hoshi

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90099-0

zbMATH Keywords

dynamic programming algorithmmonotonicity propertymultidimensional binary search treeoptimum tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10)

Cites Work

• Optimum multiway search trees
• Optimum binary search trees
• The construction of optimal multiway search trees and the monotonicity principle
• Multidimensional binary search trees used for associative searching
• Optimal Alphabetic Trees

This page was built for publication: A counter example to a monotonicity property of k-d trees