k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints

被引：2
|
作者：
Liu, Qian [1 ]
Yu, Kemin [1 ]
Li, Min [1 ]
Zhou, Yang [1 ]
机构：
[1] Shandong Normal Univ, Sch Math & Stat, Jinan 250014, Peoples R China
来源：
TSINGHUA SCIENCE AND TECHNOLOGY | 2023年 / 28卷 / 05期
基金：
中国国家自然科学基金;
关键词：
k-submodularity; knapsack constraint; matroid constraint; approximation algorithm; FUNCTION SUBJECT;
D O I：
10.26599/TST.2022.9010039
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A k-submodular function is a generalization of a submodular function, its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets. The k-submodular maximization problem has a wide range of applications. In this paper, we propose a nested greedy and local search algorithm for the problem of maximizing a monotone k-submodular function subject to a knapsack constraint and p matroid constraints.
引用
收藏
页码：896 / 905
页数：10
相关论文
共 50 条
  • [1] Maximization of k-Submodular Function with a Matroid Constraint
    Sun, Yunjing
    Liu, Yuezhu
    Li, Min
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 1 - 10
  • [2] Weakly k-submodular Maximization Under Matroid Constraint
    Wang, Yijing
    Zhang, Dongmei
    Zhang, Yapu
    Zhang, Zhenning
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 393 - 401
  • [3] Approximation Algorithms for k-Submodular Maximization Subject to a Knapsack Constraint
    Xiao, Hao
    Liu, Qian
    Zhou, Yang
    Li, Min
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024,
  • [4] Approximation Algorithms for Maximization of k-Submodular Function Under a Matroid Constraint
    Liu, Yuezhu
    Sun, Yunjing
    Li, Min
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2024, 29 (06) : 1633 - 1641
  • [5] Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint
    Pham, Canh V.
    Ha, Dung K. T.
    Hoang, Huan X.
    Tran, Tan D.
    [J]. 2022 IEEE 9TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (DSAA), 2022, : 260 - 269
  • [6] Improved approximation algorithms for k-submodular maximization under a knapsack constraint
    Ha, Dung T. K.
    V. Pham, Canh
    Tran, Tan D.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 161
  • [7] Submodular Maximization under the Intersection of Matroid and Knapsack Constraints
    Gu, Yu-Ran
    Bian, Chao
    Qian, Chao
    [J]. THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 4, 2023, : 3959 - 3967
  • [8] Non-Submodular Maximization with Matroid and Knapsack Constraints
    Wang, Yijing
    Du, Donglei
    Jiang, Yanjun
    Zhang, Xianzhao
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2021, 38 (05)
  • [9] On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
    Kemin Yu
    Min Li
    Yang Zhou
    Qian Liu
    [J]. Journal of Combinatorial Optimization, 2023, 45
  • [10] On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
    Yu, Kemin
    Li, Min
    Zhou, Yang
    Liu, Qian
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (03)
12345