On Greedy Algorithms for Decision Trees

DOI10.1007/978-3-642-17514-5_18zbMath1310.68186OpenAlexW1522510201MaRDI QIDQ3060774

Ferdinando Cicalese, Marco Molinaro, Tobias Jacobs, Eduardo Sany Laber

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_18

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (7)

Searching for quicksand ideals in partially ordered sets ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Trading off worst and expected cost in decision tree problems ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ The binary identification problem for weighted trees ⋮ Approximating decision trees with value dependent testing costs

This page was built for publication: On Greedy Algorithms for Decision Trees