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):
Displaying 13 items.
- Online BP functions maximization (Q2039657) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- Online algorithms for BP functions maximization (Q2222096) (← 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)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Coreness of cooperative games with truncated submodular profit functions (Q5915546) (← links)
- Two-stage submodular maximization under curvature (Q5925698) (← links)
- Improved algorithms for non-submodular function maximization problem (Q5970837) (← links)
- Two-stage non-submodular maximization (Q6132970) (← links)
- Two-stage BP maximization under \(p\)-matroid constraint (Q6204535) (← links)
