The power of local search: maximum coverage over a matroid
From MaRDI portal
Publication:2904797
DOI10.4230/LIPICS.STACS.2012.601zbMATH Open1245.68249MaRDI QIDQ2904797FDOQ2904797
Authors: Yuval Filmus, Justin Ward 
Publication date: 23 August 2012
Recommendations
- Monotone submodular maximization over a matroid via non-oblivious local search
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Constrained submodular maximization via greedy local search
- Maximizing a monotone submodular function subject to a matroid constraint
- Submodular maximization over multiple matroids via generalized exchange properties
Cited In (15)
- Monotone submodular maximization over a matroid via non-oblivious local search
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Matroid-constrained vertex cover
- Matroid matching: the power of local search
- Tight approximation bounds for maximum multi-coverage
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.
- Inequalities on submodular functions via term rewriting
- An accelerated continuous greedy algorithm for maximizing strong submodular functions
- A constructive proof of swap local search worst-case instances for the maximum coverage problem
- Stability and recovery for independence systems
- Siting renewable power generation assets with combinatorial optimisation
- Profit sharing and efficiency in utility games
- Arbitrary profit sharing in federated learning utility games
This page was built for publication: The power of local search: maximum coverage over a matroid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904797)
