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)

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
Submodularity and local search approaches for maximum capture problems under generalized extreme value models
Exploiting social influence to control elections based on positional scoring rules
Who should get vaccinated? Individualized allocation of vaccines over SIR network
A unifying look at sequence submodularity
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
Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Constrained submodular maximization via a nonsymmetric technique
Multi-agent submodular optimization
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
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
Streaming submodular maximization with the chance constraint
Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
Finding top-\(k\) influential users in social networks under the structural diversity model
Provable randomized rounding for minimum-similarity diversification
Dual domination problems in graphs
Modeling the spread of infectious diseases through influence maximization
A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
Union acceptable profit maximization in social networks
Maximize the probability of union-influenced in social networks
Improving the betweenness centrality of a node by adding links
Approximating robust parameterized submodular function maximization in large-scales
Community based acceptance probability maximization for target users on social networks: algorithms and analysis
Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
Ranking with submodular functions on a budget
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
Structured sparsity: discrete and convex approaches
Streaming submodular maximization under differential privacy noise
Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint
Measured continuous greedy with differential privacy
Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
\(T \times\)\textit{one Hop} approach for dynamic influence maximization problem
Constrained submodular maximization via greedy local search
Parameterized approximations for the two-sided assortment optimization
Fractional 0-1 programming and submodularity
Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
Gaussian downlink user selection subject to access limit, power budget, and rate demands
Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees
Submodular maximization over data streams with differential privacy noise
On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
Improved bounds for the greedy strategy in optimization problems with curvature
Computing representations using hypervolume scalarizations
Fast algorithms for maximizing monotone nonsubmodular functions
Fast algorithms for maximizing monotone nonsubmodular functions
Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
Welfare maximization with deferred acceptance auctions in reallocation problems
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

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)