Improved deterministic algorithms for non-monotone submodular maximization
From MaRDI portal
Publication:6168972
DOI10.1007/978-3-031-22105-7_44arXiv2208.14388OpenAlexW4313343266MaRDI QIDQ6168972
No author found.
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14388
Related Items (2)
A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity ⋮ Improved deterministic algorithms for non-monotone submodular maximization
Cites Work
- A note on maximizing a submodular set function subject to a knapsack constraint
- The budgeted maximum coverage problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Deterministic Algorithms for Submodular Maximization Problems
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Constrained Submodular Maximization via a Nonsymmetric Technique
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Submodular Maximization with Cardinality Constraints
- Fast algorithms for maximizing submodular functions
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Improved deterministic algorithms for non-monotone submodular maximization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved deterministic algorithms for non-monotone submodular maximization
