A Lower Bound for Sampling Disjoint Sets.
Mika GöösThomas WatsonPublished in: ACM Trans. Comput. Theory (2020)
Keyphrases
- disjoint sets
- lower bound
- upper bound
- group testing
- branch and bound algorithm
- disjoint subsets
- branch and bound
- np hard
- sample size
- optimal solution
- worst case
- random sampling
- objective function
- lower and upper bounds
- sufficiently accurate
- polynomial approximation
- sampling methods
- special case
- markov chain monte carlo
- sample complexity
- feature selection
- sampling algorithm
- linear programming relaxation
- parameter space
- sampling strategies
- data structure
- active learning
- genetic algorithm