Submodular maximization over multiple matroids via generalized exchange properties
From MaRDI portal
Publication:5895002
Recommendations
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing a monotone submodular function subject to a matroid constraint
- Monotone submodular maximization over a matroid via non-oblivious local search
Cited in
(51)- Informative path planning as a maximum traveling salesman problem with submodular rewards
- Approximation algorithm and its performance for maximizing submodular function subject to matroid intersection
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Euclidean maximum matchings in the plane -- local to global
- The matroid intersection cover problem
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Matroid-constrained vertex cover
- Constrained submodular maximization via a nonsymmetric technique
- Multi-agent submodular optimization
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint
- scientific article; zbMATH DE number 7650099 (Why is no real title available?)
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Concentration inequalities for nonlinear matroid intersection
- Submodular functions: learnability, structure, and optimization
- Approximate multi-matroid intersection via iterative refinement
- Performance bounds with curvature for batched greedy optimization
- Submodular stochastic probing on matroids
- Submodular secretary problems: cardinality, matching, and linear constraints
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Approximating graph-constrained max-cut
- Two-sided capacitated submodular maximization in gig platforms
- An improved analysis of local search for max-sum diversification
- Randomized strategies for robust combinatorial optimization with approximate separation
- Improved approximations for \(k\)-exchange systems (extended abstract)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Submodular Optimization with Contention Resolution Extensions.
- Concentration inequalities for nonlinear matroid intersection
- Generalized budgeted submodular set function maximization
- Generalized budgeted submodular set function maximization
- Max-cut under graph constraints
- The power of subsampling in submodular maximization
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization
- Algorithms as mechanisms: the price of anarchy of relax and round
- Euclidean maximum matchings in the plane -- local to global
- Streaming algorithms for submodular function maximization
- Submodular Maximization Through the Lens of Linear Programming
- Maximize a monotone function with a generic submodularity ratio
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- Multi-pass streaming algorithms for monotone submodular function maximization
- A multi-pass streaming algorithm for regularized submodular maximization
- Analyzing Residual Random Greedy for monotone submodular maximization
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Practical budgeted submodular maximization
- Non-submodular maximization with matroid and knapsack constraints
- The power of local search: maximum coverage over a matroid
- The multi-budget maximum weighted coverage problem
This page was built for publication: Submodular maximization over multiple matroids via generalized exchange properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895002)
