The binary identification problem for weighted trees
type: Item
instance of: scholarly article
title: The binary identification problem for weighted trees
zbMATH Open document ID: 1250.68124
author: Ferdinando Cicalese
author: Tobias Jacobs
author: Caio Valentim
author: Eduardo S. Laber
published in: Theoretical Computer Science
publication date: 2012-11-08T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6103626
zbMATH Keywords: binary identification problem
zbMATH Keywords: weighted trees
zbMATH Keywords: minimum cost strategy
zbMATH Keywords: decision tree
zbMATH Keywords: computational complexity
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.023
OpenAlex ID: W2004158059
cites work: Optimal Search in Trees
cites work: Query strategies for priced information
cites work: On Greedy Algorithms for Decision Trees
cites work: On the Complexity of Searching in Trees: Average-Case Minimization
cites work: Optimal edge ranking of trees in polynomial time
cites work: Edge ranking of weighted trees
cites work: Edge ranking and searching in partial orders
cites work: Optimal Binary Identification Procedures
cites work: On an edge ranking problem of trees and graphs
cites work: Optimum binary search trees
cites work: On binary searching with non-uniform costs
cites work: On the hardness of the minimum height decision tree problem
cites work: Q4250211
cites work: Minimum average cost testing for partially ordered components
cites work: On minimum edge ranking spanning trees
cites work: Q3579429
cites work: Constructing optimal binary decision trees is NP-complete
cites work: Decision Trees for Geometric Models
DOI: 10.1016/J.TCS.2012.06.023
description: scientific article; zbMATH DE number 6103626