Pages that link to "Item:Q2679235"
From MaRDI portal
The following pages link to A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235):
Displaying 4 items.
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity (Q6142066) (← links)
- Budget-constrained profit maximization without non-negative objective assumption in social networks (Q6635815) (← links)