Near-optimal bicriteria approximation algorithms with matching hardness for constrained submodular maximization, spanning cardinality, knapsack, matroid and convex-set constraints and monotone, general and symmetric objectives.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bicriteria Submodular Maximization
Near-optimal bicriteria approximation algorithms with matching hardness for constrained submodular maximization, spanning cardinality, knapsack, matroid and convex-set constraints and monotone, general and symmetric objectives.