CSpace
Stochastic greedy algorithms for maximizing constrained submodular plus supermodular functions
Ji, Sai1,2; Xu, Dachuan1; Li, Min3; Wang, Yishui4; Zhang, Dongmei5
2021-08-22
发表期刊CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
ISSN1532-0626
页码9
摘要The problem of maximizing the sum of a constrained submodular and a supermodular function has many applications such as social networks, machine learning, and artificial intelligence. In this article, we study the monotone submodular + supermodular maximization problem under a cardinality constraint and a p-system constraint, respectively. For each problem, we provide a stochastic algorithm and prove the approximation ratio of each algorithm theoretically. Since the algorithm of the latter problem can also solve the former problem, we do some numerical experiments of the two algorithms to compare the time as well as the quality of the two algorithms in solving the former problem.
关键词approximation algorithm constrained stochastic greedy submodular plus supermodular maximization
DOI10.1002/cpe.6575
收录类别SCI
语种英语
资助项目Beijing Natural Science Foundation Project[Z200002] ; National Natural Science Foundation of China[11871081] ; National Natural Science Foundation of China[12001039] ; Natural Science Foundation of Shandong Province[ZR2020MA029] ; Fundamental Research Funds for the Central Universities, USTB[FRF-TP-20-074A1]
WOS研究方向Computer Science
WOS类目Computer Science, Software Engineering ; Computer Science, Theory & Methods
WOS记录号WOS:000687025000001
出版者WILEY
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/59093
专题中国科学院数学与系统科学研究院
通讯作者Zhang, Dongmei
作者单位1.Beijing Univ Technol, Beijing Inst Sci & Engn Comp, Beijing, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing, Peoples R China
3.Shandong Normal Univ, Sch Math & Stat, Jinan, Peoples R China
4.Univ Sci & Technol Beijing, Sch Math & Phys, Beijing, Peoples R China
5.Shandong Jianzhu Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R China
推荐引用方式
GB/T 7714
Ji, Sai,Xu, Dachuan,Li, Min,et al. Stochastic greedy algorithms for maximizing constrained submodular plus supermodular functions[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE,2021:9.
APA Ji, Sai,Xu, Dachuan,Li, Min,Wang, Yishui,&Zhang, Dongmei.(2021).Stochastic greedy algorithms for maximizing constrained submodular plus supermodular functions.CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE,9.
MLA Ji, Sai,et al."Stochastic greedy algorithms for maximizing constrained submodular plus supermodular functions".CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2021):9.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Ji, Sai]的文章
[Xu, Dachuan]的文章
[Li, Min]的文章
百度学术
百度学术中相似的文章
[Ji, Sai]的文章
[Xu, Dachuan]的文章
[Li, Min]的文章
必应学术
必应学术中相似的文章
[Ji, Sai]的文章
[Xu, Dachuan]的文章
[Li, Min]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。