Pages that link to "Item:Q1433658"
From MaRDI portal
The following pages link to A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658):
Displayed 50 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- Budgeted nature reserve selection with diversity feature loss and arbitrary split systems (Q662604) (← links)
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems (Q683730) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Algorithms for storage allocation based on client preferences (Q975763) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- Risk averse submodular utility maximization (Q1785423) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- The knapsack problem with neighbour constraints (Q1932367) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Dual domination problems in graphs (Q2136849) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
- A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
- C2IM: community based context-aware influence maximization in social networks (Q2157993) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
- Simple and efficient budget feasible mechanisms for monotone submodular valuations (Q2190400) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666) (← links)