Constrained binary identification problem

DOI10.4230/LIPICS.STACS.2013.550zbMATH Open1354.68064OpenAlexW1582185751MaRDI QIDQ2957915FDOQ2957915

Authors: Amin Karbasi, Morteza Zadimoghaddam 

Publication date: 30 January 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/3964/pdf/52.pdf/

Recommendations

• Binary identification problems for weighted trees
• On greedy algorithms for decision trees
• Deterministic and probabilistic binary search in graphs
• The binary identification problem for weighted trees
• Decision trees for entity identification, approximation algorithms and hardness results

zbMATH Keywords

entropyapproximation algorithmsgraph algorithmsnetwork tomographybinary identification problemtree search strategies

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Searching and sorting (68P10) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (2)

• Twenty (simple) questions
• Twenty questions with noise: Bayes optimal policies for entropy loss

This page was built for publication: Constrained binary identification problem

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