Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”

DOI10.1109/TIT.2017.2749505zbMath1390.94322OpenAlexW2753984663MaRDI QIDQ4566584

Venkatesh Saligrama, Feng Nan

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2017.2749505

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

Submodular goal value of Boolean functions ⋮ Unnamed Item ⋮ Adaptive Submodular Ranking and Routing ⋮ The stochastic Boolean function evaluation problem for symmetric Boolean functions ⋮ A Tight Bound for Stochastic Submodular Cover

This page was built for publication: Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”