Binary identification problems for weighted trees

DOI10.1007/978-3-642-22300-6_22MaRDI QIDQ5199247zbMATH OpenOpenAlexFDO

Authors Ferdinando Cicalese, Tobias Jacobs, Caio Valentim, Eduardo S. Laber

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_22

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The binary identification problem for weighted trees
• Approximation strategies for generalized binary search in weighted trees
• On the complexity of searching in trees: average-case minimization
• On the complexity of searching in trees and partially ordered structures
• On the tree search problem with non-uniform costs

Cited in

(5)

• Approximation strategies for generalized binary search in weighted trees
• Constrained binary identification problem
• The binary identification problem for weighted trees
• Decision trees for entity identification, approximation algorithms and hardness results
• Performance bounds for binary testing with arbitrary weights

This page was built for publication: Binary identification problems for weighted trees

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