scientific article; zbMATH DE number 3580314
From MaRDI portal
Publication:4149262
zbMath0372.90128MaRDI QIDQ4149262
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (31)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ Experimental Design for Nonparametric Correction of Misspecified Dynamical Models ⋮ Sensor placement for fault location identification in water networks: a minimum test cover approach ⋮ Improving the Betweenness Centrality of a Node by Adding Links ⋮ Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants ⋮ Structured Robust Submodular Maximization: Offline and Online Algorithms ⋮ Stochastic-lazier-greedy algorithm for monotone non-submodular maximization ⋮ Optimal Containment of Misinformation in Social Media: A Scenario-Based Approach ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ An iterative security game for computing robust and adaptive network flows ⋮ Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Maximum entropy models and subjective interestingness: an application to tiles in binary databases ⋮ 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 ⋮ Optimizing node discovery on networks: problem definitions, fast algorithms, and observations ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ On the equivalence of optimal recommendation sets and myopically optimal query sets ⋮ Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time ⋮ Targeted influential nodes selection in location-aware social networks ⋮ 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 ⋮ Monotone submodular maximization over the bounded integer lattice with cardinality constraints ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ Spatially-Dimension-Adaptive Sparse Grids for Online Learning ⋮ Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios ⋮ Maximization of submodular functions: theory and enumeration algorithms ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Informative path planning as a maximum traveling salesman problem with submodular rewards ⋮ Unnamed Item ⋮ Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
This page was built for publication:
