Pages that link to "Item:Q3096096"
From MaRDI portal
The following pages link to Maximizing Non-monotone Submodular Functions (Q3096096):
Displayed 27 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)
- Simultaneous selection (Q906442) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← 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)
- 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)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Maximizing Symmetric Submodular Functions (Q3452815) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)