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

DOI10.1007/S00453-018-0423-8MaRDI QIDQ1755752zbMATH OpenOpenAlexFDO

Authors Aline Saettler, Ferdinando Cicalese, Eduardo S. Laber

Publication date 11 January 2019

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-018-0423-8

Mathematics Subject Classification ID

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

Recommendations

• Trading off worst and expected cost in decision tree problems
• Trading off worst and expected cost in decision tree problems
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
• Trading accuracy for simplicity in decision trees
• Approximating decision trees with value dependent testing costs
• A survey of cost-sensitive decision tree induction algorithms

Cites work

• Trading off worst and expected cost in decision tree problems

Cited in

(3)

• Trading off worst and expected cost in decision tree problems
• Trading off worst and expected cost in decision tree problems
• Erratum to: ``Consumer choice under limited attention when alternatives have different information costs

This page was built for publication: Correction to: ``Trading off worst and expected cost in decision tree problems

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