Structured Robust Submodular Maximization: Offline and Online Algorithms
From MaRDI portal
Publication:5084617
DOI10.1287/ijoc.2020.0998OpenAlexW3131437153MaRDI QIDQ5084617
Mohit Singh, Joseph (Seffi) Naor, Nima Anari, Sebastian Pokutta, Nika Haghtalab, Alfredo Torrico
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.04740
Related Items
Unified Greedy Approximability beyond Submodular Maximization, Unified greedy approximability beyond submodular maximization, Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows, Fractionally subadditive maximization under an incremental knapsack constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on maximizing a submodular set function subject to a knapsack constraint
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Efficient algorithms for online decision problems
- Robust Monotone Submodular Function Maximization
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Finding Groups in Data
- An analysis of approximations for maximizing submodular set functions—I
- Deterministic Algorithms for Submodular Maximization Problems
- Non-monotone submodular maximization under matroid and knapsack constraints
- Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
- Submodular Maximization with Cardinality Constraints
- Fast algorithms for maximizing submodular functions
- A Unified Continuous Greedy Algorithm for Submodular Maximization
