Pages that link to "Item:Q5232162"
From MaRDI portal
The following pages link to Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint (Q5232162):
Displaying 13 items.
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints (Q2697144) (← links)
- Finding the Maximum Subset with Bounded Convex Curvature (Q3132835) (← links)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
