Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
From MaRDI portal
Publication:2111542
DOI10.1007/s10878-022-00978-4OpenAlexW4315641735MaRDI QIDQ2111542
Ruiqi Yang, Min Cui, Da-Chuan Xu, Dong-lei Du
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
Cites Work
- Maximizing a class of submodular utility functions
- Simplified mechanisms with an application to sponsored-search auctions
- Facility location and supply chain management. A review
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- Parametric monotone function maximization with matroid constraints
- Approximation algorithms for maximum cut with limited unbalance
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
- Maximizing Non-monotone Submodular Functions
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Deterministic Algorithms for Submodular Maximization Problems
- Online Submodular Maximization with Preemption
- From query complexity to computational complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
