Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
From MaRDI portal
Publication:2111542
Recommendations
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- An approximation algorithm and its performance guarantee for maximizing non-increasing submodular set function
- Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Approximate solutions in set-valued optimization problems with applications to maximal monotone operators
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing monotone nonsubmodular functions
- Monotone approximations of minimum and maximum functions and multi-objective problems
- An approximation algorithm and its performance guarantee for minimizing non-decreasing supermodular set function
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5485445 (Why is no real title available?)
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Approximation algorithms for maximum cut with limited unbalance
- Combinatorial approximation algorithms for the maximum directed cut problem
- Deterministic algorithms for submodular maximization problems
- Facility location and supply chain management. A review
- From query complexity to computational complexity
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- Maximizing Non-monotone Submodular Functions
- Maximizing a class of submodular utility functions
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- Online submodular maximization with preemption
- Online submodular minimization
- Parametric monotone function maximization with matroid constraints
- Simplified mechanisms with an application to sponsored-search auctions
- Submodular maximization by simulated annealing
Cited in
(4)- Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- Minimizing ratio of monotone non-submodular functions
- Improved algorithms for non-submodular function maximization problem
This page was built for publication: Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111542)
