scientific article
From MaRDI portal
Publication:2958605
zbMath1433.68369arXiv1411.0541MaRDI QIDQ2958605
Rik Sarkar, Baharan Mirzasoleiman, Andreas Krause, Amin Karbasi
Publication date: 3 February 2017
Full work available at URL: https://arxiv.org/abs/1411.0541
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (9)
A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems ⋮ The Power of Subsampling in Submodular Maximization ⋮ Unnamed Item ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ Practical budgeted submodular maximization ⋮ LIC criterion for optimal subset selection in distributed interval estimation ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Determinantal Point Processes for Machine Learning
- Combinatorial Auctions: A Survey
- Randomized Composable Core-sets for Distributed Submodular Maximization
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Average-Case Active Learning with Costs
- Finding Groups in Data
- The coincidence approach to stochastic point processes
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- An Exact Algorithm for Maximum Entropy Sampling
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Advanced Lectures on Machine Learning
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
This page was built for publication:
