Median and hybrid median K-dimensional trees

DOI10.1007/978-3-031-20624-5_3MaRDI QIDQ6163962zbMATH OpenOpenAlexFDO

Authors Amalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura

Publication date 26 July 2023

Published in LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20624-5_3

zbMATH Keywords

\(K\)-d treesanalysis of algorithmsmultidimensional data structurespartial match queries

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Asymptotic expansion Of the incomplete beta function for large values Of the first parameter
• Divided \(k-d\) trees
• Foundations of multidimensional and metric data structures.
• scientific article; zbMATH DE number 140456 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Improved master theorems for divide-and-conquer recurrences
• Median and hybrid median K-dimensional trees
• Multidimensional binary search trees used for associative searching
• Partial match queries in relaxed multidimensional search trees
• Partial match retrieval of multidimensional data
• Squarish \(k\)-\(d\) trees

Cited in

(8)

• Resilient \(k\)-d trees: \(k\)-means in space revisited
• The median procedure for n-trees
• scientific article; zbMATH DE number 3948292 (Why is no real title available?)
• scientific article; zbMATH DE number 512926 (Why is no real title available?)
• Depth functions and mutidimensional medians on minimal spanning trees
• The asymmetric median tree. --- A new model for building consensus trees
• Median and hybrid median K-dimensional trees
• Polyhedral properties of the \(K\)-median problem on a tree

This page was built for publication: Median and hybrid median \(K\)-dimensional trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163962)