A fast algorithm for submodular maximization with a matroid constraint
From MaRDI portal
Cites work
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A threshold of ln n for approximating set cover
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An analysis of approximations for maximizing submodular set functions—I
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comments on bases in dependence structures
- Comparing apples and oranges: query trade-off in submodular maximization
- Differentially private combinatorial optimization
- Fast algorithms for maximizing submodular functions
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3026527 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximizing a monotone submodular function subject to a matroid constraint
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Optimal approximation for the submodular welfare problem in the value oracle model
- Probability Inequalities for Sums of Bounded Random Variables
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
This page was built for publication: A fast algorithm for submodular maximization with a matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945726)
