Pages that link to "Item:Q5384072"
From MaRDI portal
The following pages link to Fast algorithms for maximizing submodular functions (Q5384072):
Displaying 50 items.
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- A faster strongly polynomial time algorithm for submodular function minimization (Q1016120) (← links)
- A provably fast linear-expected-time maxima-finding algorithm (Q1329142) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time (Q2216441) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Efficient Submodular Function Maximization under Linear Packing Constraints (Q2843232) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← 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)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Robust Adaptive Submodular Maximization (Q5060800) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)
- (Q5091209) (← links)
- Seeding with Costly Network Information (Q5106371) (← links)
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
- A fast double greedy algorithm for non-monotone DR-submodular function maximization (Q5216445) (← links)
- Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint (Q5232162) (← links)
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization (Q5429271) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Guess free maximization of submodular and linear sums (Q5925508) (← links)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
- The Frank-Wolfe algorithm: a short introduction (Q6118086) (← links)
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
