Distributed submodular maximization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- scientific article; zbMATH DE number 1833405 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Advanced Lectures on Machine Learning
- An Exact Algorithm for Maximum Entropy Sampling
- An analysis of approximations for maximizing submodular set functions—I
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Average-case active learning with costs
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Combinatorial auctions: a survey
- Determinantal point processes for machine learning
- Distributed submodular maximization
- Finding Groups in Data
- Maximizing a monotone submodular function subject to a matroid constraint
- Non-monotone submodular maximization under matroid and knapsack constraints
- Randomized composable core-sets for distributed submodular maximization
- Scalable influence maximization for multiple products in continuous-time diffusion networks
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Submodular maximization by simulated annealing
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- The coincidence approach to stochastic point processes
Cited in
(19)- Restricted strong convexity implies weak submodularity
- Randomized composable core-sets for distributed submodular maximization
- LIC criterion for optimal subset selection in distributed interval estimation
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
- Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems
- Practical parallel algorithms for non-monotone submodular maximization
- Distributed strategy selection: a submodular set function maximization approach
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- Submodular optimization in the MapReduce model
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models
- Distributed maximum maintenance on hierarchically divided graphs
- Maliciously secure massively parallel computation for all-but-one corruptions
- An exact solver for submodular knapsack problems
- Distributed submodular maximization
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- The power of subsampling in submodular maximization
- Submodular optimization problems and greedy strategies: a survey
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Practical budgeted submodular maximization
This page was built for publication: Distributed submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958605)
