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)

Minimizing the Spread of Rumor Within Budget Constraint in Online Network
General rumor blocking: an efficient random algorithm with martingale approach
Restricted strong convexity implies weak submodularity
A note on solving DiDi's driver-order matching problem
Rumor correction maximization problem in social networks
A Review for Submodular Optimization on Machine Scheduling Problems
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
Parametric monotone function maximization with matroid constraints
Influence maximization with deactivation in social networks
Nonnegative definite Hermitian matrices with increasing principal minors
Submodular stochastic probing on matroids
Distributed resource allocation with binary decisions via Newton-like neural network dynamics
A model of anytime algorithm performance for bi-objective optimization
On strict submodularity of social influence
Non-monotone submodular function maximization under \(k\)-system constraint
Discriminative frequent subgraph mining with optimality guarantees
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
Online submodular welfare maximization: greedy beats 1/2 in random order
Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
Maximizing a monotone non-submodular function under a knapsack constraint
Large-scale influence maximization via maximal covering location
Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning
Unified greedy approximability beyond submodular maximization
An efficient linear programming based method for the influence maximization problem in social networks
Structured Robust Submodular Maximization: Offline and Online Algorithms
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Non-submodular streaming maximization with minimum memory and low adaptive complexity
Functional pearl: the distributive \(\lambda\)-calculus
Real-time solving of computationally hard problems using optimal algorithm portfolios
Utilitarian welfare and representation guarantees of approval-based multiwinner rules
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
Non-submodular maximization on massive data streams
Generalized budgeted submodular set function maximization
Guess free maximization of submodular and linear sums
Generalized budgeted submodular set function maximization
Approximating the least core value and least core of cooperative games with supermodular costs
Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
Submodular optimization problems and greedy strategies: a survey
An exact cutting plane method for \(k\)-submodular function maximization
Sparsity in max-plus algebra and systems
Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
A tight analysis of the submodular-supermodular procedure
Multi-pass streaming algorithms for monotone submodular function maximization
A multi-pass streaming algorithm for regularized submodular maximization
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
Analyzing Residual Random Greedy for monotone submodular maximization
Adaptive influence maximization under fixed observation time-step
Fixed observation time-step: adaptive influence maximization
Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information
Permutatorial optimization via the permutahedron
Data source selection for approximate query
Fractionally subadditive maximization under an incremental knapsack constraint
Motif-role extraction in uncertain graph based on efficient ensembles
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
The submodularity of two-stage stochastic maximum-weight independent set problems
Greedy minimization of weakly supermodular set functions
Two-stage stochastic max-weight independent set problems
Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
An ascending implementation of the Vickrey-Clarke-Groves mechanism for the licensed shared access
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
Private non-monotone submodular maximization
Algorithms for influence maximization in socio-physical networks
The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
Informative path planning as a maximum traveling salesman problem with submodular rewards
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

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)