Pages that link to "Item:Q2445844"
From MaRDI portal
The following pages link to Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844):
Displayed 5 items.
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Coreness of cooperative games with truncated submodular profit functions (Q5915546) (← links)