Pages that link to "Item:Q5429267"
From MaRDI portal
The following pages link to Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Q5429267):
Displaying 7 items.
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Beyond submodularity: a unified framework of randomized set selection with group fairness constraints (Q6039536) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Arbitrary profit sharing in federated learning utility games (Q6546278) (← links)
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models (Q6599123) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)