首页|期刊导航|高技术通讯（英文版）|Maximization of monotone non-k-submodular set function with noise under matroid constraints

Maximization of monotone non-k-submodular set function with noise under matroid constraints

Jiang Yanjun Wang Yijing Yang Ruiqi Li Ali

高技术通讯（英文版）2026，Vol.32Issue(1)：73-83,11.

高技术通讯（英文版）2026，Vol.32Issue(1)：73-83,11.DOI:10.3772/j.issn.1006-6748.2026.01.008

Maximization of monotone non-k-submodular set function with noise under matroid constraints

Jiang Yanjun ¹Wang Yijing ²Yang Ruiqi ³Li Ali⁴

作者信息

1. School of Mathematics and Statistics Science,Ludong University,Yantai 264025,P.R.China
2. Center for Strategic Assessment and Consulting,Academy of Military Science,Beijing 100091,P.R.China
3. Beijing Institute for Scientific and Engineering Computing,Beijing University of Technology,Beijing 100124,P.R.China
4. College of Computer Science and Artificial Intelligence,Ludong University,Yantai 264025,P.R.China
折叠

摘要

关键词

k-submodular set function/greedy/matroid constraints/approximation algorithm

Key words

k-submodular set function/greedy/matroid constraints/approximation algorithm

引用本文复制引用

Jiang Yanjun,Wang Yijing,Yang Ruiqi,Li Ali..Maximization of monotone non-k-submodular set function with noise under matroid constraints[J].高技术通讯（英文版）,2026,32(1):73-83,11.

基金项目

Supported by the Natural Science Foundation of Shandong Province(No.ZR2023MA031)and the Natural Science Foundation of China(No.12201619) （No.ZR2023MA031）

高技术通讯（英文版）

ISSN：1006-6748

访问量0

下载量0

段落导航