Simple algorithms for stochastic score classification with small approximation ratios
From MaRDI portal
Publication:6573003
DOI10.1137/22M1523492MaRDI QIDQ6573003FDOQ6573003
Authors: Benedikt M. Plank, Kevin Schewior 
Publication date: 16 July 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
approximation algorithmsstochastic Boolean function evaluationadaptivity gapstochastic score classification
Cites Work
- Sequential testing of complex systems: a review
- Diagnosing double regular systems
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Some Reliability Fault-Testing Models
- An optimum testing algorithm for some symmetric coherent systems
- Learning with attribute costs
- Finding optimal satisficing strategies for and-or trees
- Evaluation of monotone DNF formulas
- Query strategies for priced information
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- The stochastic Boolean function evaluation problem for symmetric Boolean functions
- Title not available (Why is that?)
- Algorithms for the unit-cost stochastic score classification problem
- Non-adaptive stochastic score classification and explainable halfspace evaluation
- Adaptivity gaps for the stochastic Boolean function evaluation problem
This page was built for publication: Simple algorithms for stochastic score classification with small approximation ratios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573003)
