Classification via two-way comparisons

DOI10.1145/3709361MaRDI QIDQ6955684zbMATH OpenFDO

Authors Marek Chrobak, Neal E. Young

Publication date 22 July 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3709361

zbMATH Keywords

algorithmsclassificationdata structuresoptimal search trees

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cites work

• A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
• Classification via two-way comparisons (extended abstract)
• Constructing optimal binary decision trees is NP-complete
• Faster construction of optimal binary split trees
• Generalized binary split trees
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Median split trees
• On Huang and Wong's algorithm for generalized binary split trees
• On the complexity of searching in trees: average-case minimization
• Optimal binary split trees
• Optimal classification trees
• Optimal search trees using two-way key comparisons
• Optimum binary search trees
• Optimum split trees
• Thresholds and optimal binary comparison search trees
• Twenty (simple) questions

This page was built for publication: Classification via two-way comparisons

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