Algorithms for the unit-cost stochastic score classification problem

DOI10.1007/s00453-022-00982-4OpenAlexW4285095396MaRDI QIDQ2088594

Lisa Hellerstein, Nathaniel Grammel, Naifeng Liu, Devorah Kletenik

Publication date: 6 October 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00982-4

zbMATH Keywords

adaptivityapproximation algorithmssymmetric Boolean functionssequential testingstochastic probing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Supersparse linear integer models for optimized medical scoring systems
• An optimum testing algorithm for some symmetric coherent systems
• Sequential testing of complex systems: a review
• Diagnosing double regular systems
• The stochastic Boolean function evaluation problem for symmetric Boolean functions
• Non-adaptive stochastic score classification and explainable halfspace evaluation
• Finding optimal satisficing strategies for and-or trees
• Optimal Testing Procedures for Special Structures of Coherent Systems
• A Stochastic Probing Problem with Applications
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
• Learning Optimized Risk Scores