No article text was recorded for this version.
deterministic submodular maximization
Version 1 of 118 papers24 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Deterministic Algorithms for Submodular Maximization Problems
- Blog: Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Blog: Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
- Blog: Improved Deterministic Algorithms for Non-monotone Submodular Maximization
- Blog: Optimization with Demand Oracles.
- Blog: Efficient Submodular Function Maximization under Linear Packing Constraints
- Blog: Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation
- Blog: Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint
- Blog: Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
- Blog: Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
- Blog: Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
- Blog: Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
- Blog: The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Blog: Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
- Blog: Non-monotone Submodular Maximization in Exponentially Fewer Iterations
- Blog: Randomized Composable Core-sets for Distributed Submodular Maximization
- Blog: Non-monotone submodular maximization under matroid and knapsack constraints
- Blog: Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
History & citation
Current · Permanent link
- This direction split from constraint generalization (50% overlap)
- This direction split from Non-monotone Submodular Maximization in Dynamic and Constrained Environments (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_deterministic_submodular_maximization_2433af5e,
title = {deterministic submodular maximization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-submodular-maximization/rdr_2433af5ec0424e94b9deae5323c73201},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_deterministic_submodular_maximization_2433af5e_v1,
title = {deterministic submodular maximization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/deterministic-submodular-maximization/rdr_2433af5ec0424e94b9deae5323c73201/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}