An analysis of approximations for maximizing submodular set functions—I

Cites work

scientific article; zbMATH DE number 3461943 (Why is no real title available?)
scientific article; zbMATH DE number 3313442 (Why is no real title available?)
A cost function property for plant location problems
Comments on the note of Frieze
Cores of convex games
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Matroids and the greedy algorithm

Cited in

(only showing first 100 items - show all)

Informative path planning as a maximum traveling salesman problem with submodular rewards
On the approximability of the link building problem
Welfare maximization with deferred acceptance auctions in reallocation problems
Capacity games with supply function competition
Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
Improved deterministic algorithms for non-monotone submodular maximization
On the equivalence of optimal recommendation sets and myopically optimal query sets
An exact solution framework for the multiple gradual cover location problem
Polymatroids and mean-risk minimization in discrete optimization
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Minimizing the Spread of Rumor Within Budget Constraint in Online Network
Two-stage non-submodular maximization
Maximizing the influence with \(\kappa\)-grouping constraint
On maximizing sums of non-monotone submodular and linear functions
Optimizing spread dynamics on graphs by message passing
Micro- and macromodels of social networks. I: Theory fundamentals
General rumor blocking: an efficient random algorithm with martingale approach
An adaptive algorithm for maximization of non-submodular function with a matroid constraint
Sequence independent lifting for a set of submodular maximization problems
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Submodular function minimization and polarity
Toward Robust Monitoring of Malicious Outbreaks
Deals or no deals: contract design for online advertising
Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Improved algorithms for non-submodular function maximization problem
Activity preserving graph simplification
Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model
Stochastic block-coordinate gradient projection algorithms for submodular maximization
A Fast and Scalable Computational Framework for Large-Scale High-Dimensional Bayesian Optimal Experimental Design
Hooked on IP
Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
Maximizing set function formulation of two scheduling problems
Roof duality, complementation and persistency in quadratic 0–1 optimization
Algorithms for covering multiple submodular constraints and applications
Exploiting social influence to control elections based on positional scoring rules
Who should get vaccinated? Individualized allocation of vaccines over SIR network
Streaming algorithms for robust submodular maximization
Influence maximization problem: properties and algorithms
Inferring range of information diffusion based on historical frequent items
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
Matching influence maximization in social networks
A unifying look at sequence submodularity
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
Restricted strong convexity implies weak submodularity
Improved deterministic algorithms for non-monotone submodular maximization
Approximation for maximizing monotone non-decreasing set functions with a greedy method
A PTAS for the minimization of polynomials of fixed degree over the simplex
Efficient, optimal stochastic-action selection when limited by an action budget
ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
Discriminative models for multi-class object layout
Multi-attribute proportional representation
Recommending links through influence maximization
Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
Complexity and approximation results for the balance optimization subset selection model for causal inference in observational studies
Per-round knapsack-constrained linear submodular bandits
Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Influence maximization in the presence of vulnerable nodes: a ratio perspective
Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
Adaptive algorithms on maximizing monotone nonsubmodular functions
Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
A first hitting time approach to finding effective spreaders in a network
Greedy is good: constrained non-submodular function maximization via weak submodularity
A note on solving DiDi's driver-order matching problem
Rumor correction maximization problem in social networks
Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
Unified Greedy Approximability beyond Submodular Maximization
Submodularity and randomized rounding techniques for optimal experimental design
Constrained submodular maximization via a nonsymmetric technique
Robust maximum capture facility location under random utility maximization models
Multi-agent submodular optimization
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
On the supermodular knapsack problem
Minimizing ratio of monotone non-submodular functions
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
Optimal approximability of bookmark assignments
A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
A Canonical Representation of Simple Plant Location Problems and Its Applications
Optimal experimental design for infinite-dimensional Bayesian inverse problems governed by PDEs: a review
Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
Top-\(k\) overlapping densest subgraphs
Pseudo-Boolean optimization
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
Optimal intervention in economic networks using influence maximization methods
Maximum coverage with cluster constraints: an LP-based approximation technique
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
General bounds for incremental maximization
Algorithms for storage allocation based on client preferences
Clustering on trees
Is submodularity testable?
Fast parallel algorithms for submodular \(p\)-superseparable maximization
Model change active learning in graph-based semi-supervised learning
Two generalizations of proper coloring: hardness and approximability
A Review for Submodular Optimization on Machine Scheduling Problems
An approximation algorithm for maximum weight budgeted connected set cover
Video distribution under multiple constraints
Multiobjective Tree-Structured Parzen Estimator
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
scientific article; zbMATH DE number 7650099 (Why is no real title available?)

This page was built for publication: An analysis of approximations for maximizing submodular set functions—I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152030)