Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
From MaRDI portal
Publication:2111542
DOI10.1007/S10878-022-00978-4OpenAlexW4315641735MaRDI QIDQ2111542FDOQ2111542
Authors: Min Cui, Ruiqi Yang, Donglei Du, Dachuan Xu 
Publication date: 17 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00978-4
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
- Facility location and supply chain management. A review
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing Non-monotone Submodular Functions
- Title not available (Why is that?)
- Simplified mechanisms with an application to sponsored-search auctions
- Combinatorial approximation algorithms for the maximum directed cut problem
- Title not available (Why is that?)
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Maximizing a class of submodular utility functions
- From query complexity to computational complexity
- Approximation algorithms for maximum cut with limited unbalance
- Deterministic Algorithms for Submodular Maximization Problems
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Online Submodular Maximization with Preemption
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- Parametric monotone function maximization with matroid constraints
Cited In (2)
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)
