Pages that link to "Item:Q5171225"
From MaRDI portal
The following pages link to Symmetry and Approximability of Submodular Maximization Problems (Q5171225):
Displaying 13 items.
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Inequalities on submodular functions via term rewriting (Q2444736) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- (Q5743502) (← links)