A framework based on cost amortization and local approximation gives constant-factor approximation algorithms for combinatorial selection with costly information under matroid constraints.
The pandora's box problem with sequential inspections
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Combinatorial Selection with Costly Information
A framework based on cost amortization and local approximation gives constant-factor approximation algorithms for combinatorial selection with costly information under matroid constraints.