Pages that link to "Item:Q1801019"
From MaRDI portal
The following pages link to Robust monotone submodular function maximization (Q1801019):
Displaying 15 items.
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Adaptive robust submodular optimization and beyond (Q2039658) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
- (Q3096214) (← links)
- Data-Driven Robust Resource Allocation with Monotonic Cost Functions (Q5031001) (← links)
- Robust Maximization of Correlated Submodular Functions Under Cardinality and Matroid Constraints (Q5033923) (← links)
- Network Inspection for Detecting Strategic Attacks (Q5080657) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
- Robust maximum capture facility location under random utility maximization models (Q6113461) (← links)
- Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
- Efficient algorithms for \(k\)-submodular function maximization with \(p\)-system and \(d\)-knapsack constraint (Q6606189) (← links)
- Greedy algorithm for maximization of semi-monotone non-submodular functions with applications (Q6612543) (← links)
