Pages that link to "Item:Q3096096"
From MaRDI portal
The following pages link to Maximizing Non-monotone Submodular Functions (Q3096096):
Displayed 50 items.
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Blocking rumor by cut (Q721923) (← links)
- Simultaneous selection (Q906442) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Streaming submodular maximization under differential privacy noise (Q2150568) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
- Information coverage maximization for multiple products in social networks (Q2182654) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
- Profit maximization problem with coupons in social networks (Q2282999) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Set function optimization (Q2314057) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- A tight analysis of the submodular-supermodular procedure (Q2345618) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Inequalities on submodular functions via term rewriting (Q2444736) (← links)
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities (Q2453122) (← links)
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function (Q2661580) (← links)
- On additive approximate submodularity (Q2672599) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Submodular maximization over data streams with differential privacy noise (Q2680174) (← links)
- Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)