scientific article; zbMATH DE number 3580314

Cited in

(32)

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

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)