A polynomial-time, constant-factor approximation algorithm exists for selecting k matroid-constrained solutions to maximize the expected value of the best solution under independent Bernoulli item activations.
Predictive flows for faster ford-fulkerson
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Data-Driven Solution Portfolios
A polynomial-time, constant-factor approximation algorithm exists for selecting k matroid-constrained solutions to maximize the expected value of the best solution under independent Bernoulli item activations.