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.
Deterministic algorithms for submodular maximization problems
1 Pith paper cite this work, alongside 49 external citations. Polarity classification is still indexing.
1
Pith paper citing it
49
external citations · OpenAlex
citation-role summary
other 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 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.