Trading off worst and expected cost in decision tree problems

DOI10.1007/s00453-016-0211-2zbMath1380.68447OpenAlexW2519048255MaRDI QIDQ1679235

Ferdinando Cicalese, Aline Saettler, Eduardo Sany Laber

Publication date: 9 November 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0211-2

zbMATH Keywords

combinatorial optimizationdecision treesapproximation algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items

Correction to: ``Trading off worst and expected cost in decision tree problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum length of Huffman codes
• Approximating optimal binary decision trees
• On Greedy Algorithms for Decision Trees
• Decision trees for entity identification
• A fast algorithm for optimal length-limited Huffman codes
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
• Average-Case Active Learning with Costs
• Height Restricted Optimal Binary Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• Optimal Binary Identification Procedures
• Bounding the inefficiency of length-restricted prefix codes