Maximizing Approximately Non-k-Submodular Monotone Set Function with Matroid Constraint

被引:0
|
作者
Jiang, Yanjun [1 ]
Wang, Yijing [2 ]
Yang, Ruiqi [3 ,4 ]
Ye, Weina [3 ]
机构
[1] Ludong Univ, Sch Math & Stat Sci, Yantai 264025, Peoples R China
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[3] Beijing Univ Technol, Beijing Inst Sci & Engn Comp, Beijing 100124, Peoples R China
[4] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
基金
中国博士后科学基金; 北京市自然科学基金; 中国国家自然科学基金;
关键词
k-submodular set function; Matroid; Greedy; Approximation algorithm;
D O I
10.1007/978-3-031-20350-3_2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Utilizing approximation algorithm, there has been a large quantity of work on optimization for submodular functions since the 1970s. As a variant, k-submodular function appears in many fields to match with the developing background, in which the outputted sets changes from one to k. Because of the application of submodularity, some concepts and parameters describing the closeness to submodular function are generated, for example approximately submodular set function and diminishing-return (DR) ratio. In our discussion, the k-dimension set function with matroid constraint we will maximize may not have access to the submodularity. However it is an approximately non-k-submodular set function which contains DR ratio. By the greedy technique, we obtain the approximation algorithms. When the value of the DR ratio is set one, some known results are covered.
引用
收藏
页码:11 / 20
页数:10
相关论文
共 50 条
  • [1] On maximizing a monotone k-submodular function subject to a matroid constraint
    Sakaue, Shinsaku
    [J]. DISCRETE OPTIMIZATION, 2017, 23 : 105 - 113
  • [2] MAXIMIZING A MONOTONE SUBMODULAR FUNCTION SUBJECT TO A MATROID CONSTRAINT
    Calinescu, Gruia
    Chekuri, Chandra
    Pal, Martin
    Vondrak, Jan
    [J]. SIAM JOURNAL ON COMPUTING, 2011, 40 (06) : 1740 - 1766
  • [3] On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint
    Wang, Yijing
    Xu, Yicheng
    Yang, Xiaoguang
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 75 - 85
  • [4] Maximizing a submodular set function subject to a matroid constraint (Extended abstract)
    Calinescu, Gruia
    Chekuri, Chandra
    Pal, Martin
    Vondrak, Jan
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4513 : 182 - +
  • [5] On maximizing a monotone k-submodular function under a knapsack constraint
    Tang, Zhongzheng
    Wang, Chenhao
    Chan, Hau
    [J]. OPERATIONS RESEARCH LETTERS, 2022, 50 (01) : 28 - 31
  • [6] Maximizing a monotone non-submodular function under a knapsack constraint
    Zhenning Zhang
    Bin Liu
    Yishui Wang
    Dachuan Xu
    Dongmei Zhang
    [J]. Journal of Combinatorial Optimization, 2022, 43 : 1125 - 1148
  • [7] 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
  • [8] Maximizing a monotone non-submodular function under a knapsack constraint
    Zhang, Zhenning
    Liu, Bin
    Wang, Yishui
    Xu, Dachuan
    Zhang, Dongmei
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (05) : 1125 - 1148
  • [9] 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)
  • [10] 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