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