scientific article; zbMATH DE number 3580314
From MaRDI portal
Publication:4149262
zbMATH Open0372.90128MaRDI QIDQ4149262FDOQ4149262
Authors: Michel Minoux 
Publication date: 1978
Title of this publication is not available (Why is that?)
Cited In (32)
- Detecting the driver nodes of temporal networks
- On the equivalence of optimal recommendation sets and myopically optimal query sets
- 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
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
- Influence maximization in the presence of vulnerable nodes: a ratio perspective
- Title not available (Why is that?)
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Efficient processing of \(k\)-regret minimization queries with theoretical guarantees
- 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
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- Spatially-Dimension-Adaptive Sparse Grids for Online Learning
- Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- Maximization of submodular functions: theory and enumeration algorithms
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
- An iterative security game for computing robust and adaptive network flows
- Experimental Design for Nonparametric Correction of Misspecified Dynamical Models
- Interactive optimization of submodular functions under matroid constraints
- Improving the Betweenness Centrality of a Node by Adding Links
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- 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
- 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)
