An analysis of approximations for maximizing submodular set functions—I

Cites Work

Cores of convex games
Title not available (Why is that?)
Matroids and the greedy algorithm
A cost function property for plant location problems
Comments on the note of Frieze
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

Optimizing spread dynamics on graphs by message passing
Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model
Approximation for maximizing monotone non-decreasing set functions with a greedy method
Hooked on IP
Streaming algorithms for robust submodular maximization
Influence maximization problem: properties and algorithms
Inferring range of information diffusion based on historical frequent items
ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
Submodularity and randomized rounding techniques for optimal experimental design
Multiobjective Tree-Structured Parzen Estimator
Algorithms for storage allocation based on client preferences
Video distribution under multiple constraints
Optimally learning social networks with activations and suppressions
Robust monotone submodular function maximization
Attribute based diversification of seeds for targeted influence maximization
Heuristic methods and applications: A categorized survey
Tight approximation bounds for maximum multi-coverage
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
Tight approximation bounds for maximum multi-coverage
Title not available (Why is that?)
Performance bounds with curvature for batched greedy optimization
Stochastic conditional gradient methods: from convex minimization to submodular maximization
A neighbour scale fixed approach for influence maximization in social networks
Election control through social influence with unknown preferences
An exact penalty function approach for nonlinear integer programming problems
Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations
Novel algorithms for maximum DS decomposition
Locating flow-intercepting facilities: New approaches and results
Differential approximation schemes for half-product related functions and their scheduling applications
Approximability issues for unconstrained and constrained maximization of half-product related functions
On general threshold and general cascade models of social influence
Set function optimization
Inequalities on submodular functions via term rewriting
Limitations of randomized mechanisms for combinatorial auctions
An accelerated continuous greedy algorithm for maximizing strong submodular functions
A cost operator approach to multistage location-allocation
Item Pricing for Combinatorial Public Projects
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
Measures minimizing regularized dispersion
Disjoint bases in a polymatroid
A greedy Galerkin method to efficiently select sensors for linear dynamical systems
Robust placement of sensors in dynamic water distribution systems
Centralized and decentralized rumor blocking problems
The Expressive Power of Binary Submodular Functions
Streaming algorithms for submodular function maximization
Submodular Maximization Through the Lens of Linear Programming
A tree search algorithm for the multi-commodity location problem
A supermodular relaxation for scheduling with release dates
Pick-and-choose heuristics for partial set covering
Strong formulations for quadratic optimization with M-matrices and indicator variables
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
Supermodular covering knapsack polytope
Spreading dynamics in complex networks
An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
Monotone submodular maximization over the bounded integer lattice with cardinality constraints
A fast double greedy algorithm for non-monotone DR-submodular function maximization
Logical processing for integer programming
Streaming submodular maximization under \(d\)-knapsack constraints
New performance guarantees for the greedy maximization of submodular set functions
Item bidding for combinatorial public projects
Optimization with uniform size queries
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
On the approximability of the link building problem
An exact solution framework for the multiple gradual cover location problem
Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
Polymatroids and mean-risk minimization in discrete optimization
A Fast and Scalable Computational Framework for Large-Scale High-Dimensional Bayesian Optimal Experimental Design
Micro- and macromodels of social networks. I: Theory fundamentals
Roof duality, complementation and persistency in quadratic 0–1 optimization
A PTAS for the minimization of polynomials of fixed degree over the simplex
Discriminative models for multi-class object layout
A Canonical Representation of Simple Plant Location Problems and Its Applications
On the supermodular knapsack problem
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
Pseudo-Boolean optimization
Clustering on trees
Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
Is submodularity testable?
Pareto optimization for subset selection with dynamic cost constraints
An approximation algorithm for maximum weight budgeted connected set cover
Submodular functions: learnability, structure, and optimization
Maximizing a non-decreasing non-submodular function subject to various types of constraints
An individual-based model of information diffusion combining friends' influence
Directed submodularity, ditroids and directed submodular flows
A note on maximizing a submodular set function subject to a knapsack constraint
Approximation algorithms for maximum weight k-coverings of graphs by packings
Exact hypervolume subset selection through incremental computations
Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
Locating service facilities whose reliability is distance dependent.
Thresholded covering algorithms for robust and max-min optimization
Structure preserving reductions among convex optimization problems
Minimization of ordered, symmetric half-products
Fixed points approach to clustering
The expressive power of binary submodular functions
Idempotent expansions for continuous-time stochastic control
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
On an approximation measure founded on the links between optimization and polynomial approximation theory
An analysis of the greedy algorithm for the submodular set covering problem
Sensor placement for fault location identification in water networks: a minimum test cover approach

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)