[KongchangAI]
Concept预算约束覆盖问题

coverage problem under budget constraints

This is a classical problem in combinatorial optimization: under a given total budget, select a set of actions to maximize the number of covered errors or minimize residual errors. It is a variant of the set cover problem.

Timeline (last 90 days)

Nov 5

The study models non-adaptive auditing as a coverage problem under a budget constraint and characterizes the decision-relevant minimal error statistic.

Unverified50%

All Facts (1)

Source Articles