Decision trees for entity identification
From MaRDI portal
Publication:3188997
DOI10.1145/1921659.1921661zbMath1295.68210MaRDI QIDQ3188997
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Pranjal Awasthi, Sambuddha Roy, Mukesh Mohania
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1921659.1921661
05C90: Applications of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Adaptive Submodular Ranking and Routing, Improved approximation algorithms for the average-case tree searching problem, Hardness and inapproximability of minimizing adaptive distinguishing sequences, An approximation algorithm for binary searching in trees, On the complexity of searching in trees and partially ordered structures, Decision trees for function evaluation: simultaneous optimization of worst and expected cost, Trading off worst and expected cost in decision tree problems, On the Huffman and alphabetic tree problem with general cost functions, Approximating optimal binary decision trees, Decision-theoretic troubleshooting: hardness of approximation, Average-Case Active Learning with Costs
