Fixed-parameter tractable submodular maximization over a matroid
From MaRDI portal
Cites work
- A Multiple Exchange Property for Bases
- An exchange theorem for bases of matroids
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Comments on bases in dependence structures
- Dependent randomized rounding via exchange properties of combinatorial structures
- Fast algorithms for maximizing submodular functions
- FPT approximation schemes for maximizing submodular functions
- From query complexity to computational complexity
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Maximizing non-monotone submodular functions over small subsets: beyond 1/2-approximation
- On maximizing sums of non-monotone submodular and linear functions
- Streaming submodular maximization under matroid constraints
- Submodular maximization meets streaming: matchings, matroids, and more
- Submodular maximization subject to matroid intersection on the fly
- Submodular maximization with cardinality constraints
- Submodular secretary problem with shortlists
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
This page was built for publication: Fixed-parameter tractable submodular maximization over a matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445635)