The following pages link to (Q4633865):
Displayed 8 items.
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Approximation for maximizing monotone non-decreasing set functions with a greedy method (Q5963607) (← links)