Approximating Optimal Binary Decision Trees

DOI10.1007/978-3-540-85363-3_1zbMath1159.68662OpenAlexW1811083715MaRDI QIDQ3541782

Brent Heeringa, Micah Adler

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_1

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (8)

Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Average-Case Active Learning with Costs ⋮ Unnamed Item ⋮ Approximating decision trees with value dependent testing costs

This page was built for publication: Approximating Optimal Binary Decision Trees