Non-Submodular Maximization with Matroid and Knapsack Constraints
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH(2021)
摘要
We investigate the problem of maximizing a gamma-submodular function subject to one or multiple matroid constraints and one knapsack constraint. By the greedy local search technique, we present approximation algorithms with constant approximation ratios. When gamma = 1, our model reduces to the regular submodular maximization problem investigated in the literature under the same type of constraints. Our results therefore contribute towards the line of research on constrained non-submodular function maximization.
更多查看译文
关键词
Non-submodular maximization,matroid,knapsack,approximation algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要