Adaptive algorithms on maximizing monotone nonsubmodular functions
From MaRDI portal
Recommendations
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- The adaptive complexity of maximizing a submodular function
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
Cites work
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An analysis of approximations for maximizing submodular set functions—I
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fast algorithms for maximizing submodular functions
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximize a monotone function with a generic submodularity ratio
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Submodular maximization with nearly optimal approximation, adaptivity and query complexity
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
- The adaptive complexity of maximizing a submodular function
Cited in
(2)
This page was built for publication: Adaptive algorithms on maximizing monotone nonsubmodular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566785)
