Best Algorithms for Approximating the Maximum of a Submodular Set Function
From MaRDI portal
(Redirected from Publication:4178796)
Cited in
(only showing first 100 items - show all)- Maximization of submodular functions: theory and enumeration algorithms
- Local optimization on graphs
- Lower bounds on the worst-case complexity of some oracle algorithms
- An approximation algorithm for a competitive facility location problem with network effects
- Robust monotone submodular function maximization
- Dividing and conquering the square
- The simple plant location problem: Survey and synthesis
- An optimization approach to plan for reusable software components
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- A note on solving DiDi's driver-order matching problem
- Learning diffusion on global graph: a PDE-directed approach for feature detection on geometric shapes
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
- A refined analysis of submodular greedy
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Private non-monotone submodular maximization
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Submodular function minimization and polarity
- Adaptive seeding for profit maximization in social networks
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Siting renewable power generation assets with combinatorial optimisation
- Ranking with submodular functions on a budget
- Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint
- Measured continuous greedy with differential privacy
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Maximize a monotone function with a generic submodularity ratio
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- Viral marketing of online game by DS decomposition in social networks
- Constrained submodular maximization via greedy local search
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- Minimizing ratio of monotone non-submodular functions
- Optimization with demand oracles
- Bulk-robust combinatorial optimization
- The matroid intersection cover problem
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Analyzing Residual Random Greedy for monotone submodular maximization
- Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences
- Streaming submodular maximization under \(d\)-knapsack constraints
- Practical budgeted submodular maximization
- Hub location as the minimization of a supermodular set function
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- Discrete stochastic submodular maximization: adaptive vs. non-adaptive vs. offline
- Distributed submodular maximization
- A Probabilistic Analysis of the K-Location Problem
- Robust monotone submodular function maximization
- Submodular stochastic probing on matroids
- Gradient methods of maximization of convex functions on discrete structures
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Maximizing set function formulation of two scheduling problems
- NP-Complete operations research problems and approximation algorithms
- A first hitting time approach to finding effective spreaders in a network
- Online submodular maximization with preemption
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Multi-agent submodular optimization
- Non-submodular maximization with matroid and knapsack constraints
- Tight approximation for unconstrained XOS maximization
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
- Generalized assignment via submodular optimization with reserved capacity
- The power of subsampling in submodular maximization
- Submodular secretary problem with shortlists
- Capturing complementarity in set functions by going beyond submodularity/subadditivity
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Constrained submodular maximization via a nonsymmetric technique
- Submodular Maximization Through the Lens of Linear Programming
- An improved analysis of local search for max-sum diversification
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- New performance guarantees for the greedy maximization of submodular set functions
- Some comments on the Slater number
- Maximizing a class of submodular utility functions
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing monotone nonsubmodular functions
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Guess free maximization of submodular and linear sums
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Distributed strategy selection: a submodular set function maximization approach
- On maximizing sums of non-monotone submodular and linear functions
- Improved deterministic algorithms for non-monotone submodular maximization
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
- Streaming submodular maximization with the chance constraint
- Improved deterministic algorithms for non-monotone submodular maximization
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- Regularized nonmonotone submodular maximization
- Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
- Fast parallel algorithms for submodular \(p\)-superseparable maximization
- Optimal experimental design: formulations and computations
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions
- Robust algorithms under adversarial injections
- On maximizing k-submodular functions under p-system and d-knapsack constraints
- Subquadratic submodular maximization with a general matroid constraint
- Separating coverage and submodular: maximization subject to a cardinality constraint
This page was built for publication: Best Algorithms for Approximating the Maximum of a Submodular Set Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178796)
