scientific article

zbMath1225.90107MaRDI QIDQ3096214

Carlos Guestrin, Andreas Krause, H. Brendan McMahan, Anupam Gupta

Publication date: 8 November 2011

Full work available at URL: http://www.jmlr.org/papers/v9/krause08b.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Gaussian processesactive learningexperimental designsubmodular functionsobservation selection

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (28)

Streaming algorithms for robust submodular maximization ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Robust Monotone Submodular Function Maximization ⋮ Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants ⋮ Network Inspection for Detecting Strategic Attacks ⋮ Structured Robust Submodular Maximization: Offline and Online Algorithms ⋮ Stochastic-lazier-greedy algorithm for monotone non-submodular maximization ⋮ Recognizing Coverage Functions ⋮ Online risk-averse submodular maximization ⋮ Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint ⋮ Robust maximum capture facility location under random utility maximization models ⋮ Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ Robust networked multiagent optimization: designing agents to repair their own utility functions ⋮ Unified greedy approximability beyond submodular maximization ⋮ Randomized strategies for robust combinatorial optimization with approximate separation ⋮ The Complexity of Partial Function Extension for Coverage Functions ⋮ On maximizing a monotone \(k\)-submodular function subject to a matroid constraint ⋮ Running time analysis of the (1+1)-EA for robust linear optimization ⋮ Robust budget allocation via continuous submodular functions ⋮ Approximating Robust Parameterized Submodular Function Maximization in Large-Scales ⋮ Risk averse submodular utility maximization ⋮ Adaptive robust submodular optimization and beyond ⋮ Robust monotone submodular function maximization ⋮ Unnamed Item ⋮ The submodularity of two-stage stochastic maximum-weight independent set problems ⋮ Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization ⋮ General bounds for incremental maximization

This page was built for publication: