A framework based on cost amortization and local approximation gives constant-factor approximation algorithms for combinatorial selection with costly information under matroid constraints.
Pandora's problem with combinatorial cost
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.