Submodular Optimization with Contention Resolution Extensions.

DOI10.4230/LIPICS.APPROX-RANDOM.2019.3OpenAlexW2978959605MaRDI QIDQ5875454

Benjamin Moseley, M. I. Sviridenko

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.3

zbMATH Keywords

optimizationapproximation algorithmsubmodularinterval scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetry and Approximability of Submodular Maximization Problems
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Maximizing Non-monotone Submodular Functions
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Constrained Submodular Maximization via a Nonsymmetric Technique
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

This page was built for publication: Submodular Optimization with Contention Resolution Extensions.