Sequential testing with subadditive costs
From MaRDI portal
Cites work
- A polynomial-time approximation scheme for sequential batch testing of series systems
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- An optimal sequence in multicharacteristic inspection
- Approximating min sum set cover
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation algorithms for sequential batch-testing of series systems
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Finding optimal satisficing strategies for and-or trees
- Maintenance scheduling for modular systems: modeling and algorithms
- Non-adaptive stochastic score classification and explainable halfspace evaluation
- On chromatic sums and distributed resource allocation
- Optimal task sequencing with precedence constraints
- Optimal Testing Procedures for Special Structures of Coherent Systems
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- Sequential testing in batches
- Sequential testing of complex systems: a review
- Sequential testing with subadditive costs
- Some Reliability Fault-Testing Models
- The stochastic score classification problem
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
This page was built for publication: Sequential testing with subadditive costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880130)
