Subquadratic submodular maximization with a general matroid constraint
From MaRDI portal
Cites work
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- A new framework for distributed submodular maximization
- A threshold of ln n for approximating set cover
- A tight combinatorial algorithm for submodular maximization subject to a matroid constraint
- An analysis of approximations for maximizing submodular set functions—I
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Breaking the quadratic barrier for matroid intersection
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comparing apples and oranges: query trade-off in submodular maximization
- Dependent randomized rounding via exchange properties of combinatorial structures
- Dynamic algorithms for matroid submodular maximization
- Efficient Submodular Function Maximization under Linear Packing Constraints
- Fast algorithms for maximizing submodular functions
- Fast algorithms via dynamic-oracle matroids
- Faster matroid intersection
- Faster matroid partition algorithms
- Faster submodular maximization for several classes of matroids
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 7768369 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- On multiplicative weight updates for concave and submodular function maximization
- On the complexity of dynamic submodular maximization
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Submodular maximization with cardinality constraints
- Submodular maximization with matroid and packing constraints in parallel
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
- Submodular optimization in the MapReduce model
- Subquadratic weighted matroid intersection under rank oracles
- The adaptive complexity of maximizing a submodular function
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
Cited in
(1)
This page was built for publication: Subquadratic submodular maximization with a general matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875092)
