Non-Submodular Maximization with Matroid and Knapsack Constraints

We investigate the problem of maximizing a [Formula: see text]-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 [Formula: see text], our m...

Full description

Saved in:
Bibliographic Details
Published inAsia-Pacific journal of operational research Vol. 38; no. 5
Main Authors Wang, Yijing, Du, Donglei, Jiang, Yanjun, Zhang, Xianzhao
Format Journal Article
LanguageEnglish
Published Singapore World Scientific Publishing Co. Pte., Ltd 01.10.2021
Subjects
Algorithms
Approximation
Constraints
Mathematical analysis
Maximization
Operations research
Optimization
Online AccessGet full text
ISSN0217-5959
1793-7019
0217-5959
DOI10.1142/S0217595921400017

Cover

More Information
Summary:We investigate the problem of maximizing a [Formula: see text]-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 [Formula: see text], 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0217-5959
1793-7019
0217-5959
DOI:10.1142/S0217595921400017