scientific article; zbMATH DE number 3580314

Cited in

(40)

Maximization of submodular functions: theory and enumeration algorithms
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
Targeted influential nodes selection in location-aware social networks
Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants
Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
On the equivalence of optimal recommendation sets and myopically optimal query sets
Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
Influence maximization in the presence of vulnerable nodes: a ratio perspective
Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
I/O-efficient calculation of H-group closeness centrality over disk-resident graphs
Informative path planning as a maximum traveling salesman problem with submodular rewards
Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
Fair allocation of indivisible goods: beyond additive valuations
An iterative security game for computing robust and adaptive network flows
Interactive optimization of submodular functions under matroid constraints
Spatially-Dimension-Adaptive Sparse Grids for Online Learning
Optimal containment of misinformation in social media: a scenario-based approach
Distributed submodular maximization
Sensor placement for fault location identification in water networks: a minimum test cover approach
Experimental design for nonparametric correction of misspecified dynamical models
A tight linear time (1/2)-approximation for unconstrained submodular maximization
Maximum entropy models and subjective interestingness: an application to tiles in binary databases
Improving the betweenness centrality of a node by adding links
Structured Robust Submodular Maximization: Offline and Online Algorithms
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Monotone submodular maximization over the bounded integer lattice with cardinality constraints
Approximation algorithms in combinatorial scientific computing
Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling
Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
Efficient processing of k-regret minimization queries with theoretical guarantees
Detecting the driver nodes of temporal networks
Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
Practical parallel algorithms for non-monotone submodular maximization
Fully dynamic submodular maximization over matroids
A primal-dual algorithm for monotone submodular maximization
An exact solver for submodular knapsack problems
SubModST: a fast generic solver for submodular maximization with size constraints
Title not available (Why is no real title available?)
Submodularity of the expected information gain in infinite-dimensional linear inverse problems
Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios

This page was built for publication:

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