Pages that link to "Item:Q2904797"
From MaRDI portal
The following pages link to The power of local search: maximum coverage over a matroid (Q2904797):
Displaying 13 items.
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Inequalities on submodular functions via term rewriting (Q2444736) (← links)
- Matroid matching: the power of local search (Q2875164) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- (Q5111732) (← links)
- Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8 (Q5714612) (← links)
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. (Q6075891) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Arbitrary profit sharing in federated learning utility games (Q6546278) (← links)