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
Source PublicationCONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
ISSN1532-0626
Pages9
AbstractThe 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.
Keywordapproximation algorithm constrained stochastic greedy submodular plus supermodular maximization
DOI10.1002/cpe.6575
Indexed BySCI
Language英语
Funding ProjectBeijing 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 Research AreaComputer Science
WOS SubjectComputer Science, Software Engineering ; Computer Science, Theory & Methods
WOS IDWOS:000687025000001
PublisherWILEY
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/59093
Collection中国科学院数学与系统科学研究院
Corresponding AuthorZhang, Dongmei
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ji, Sai]'s Articles
[Xu, Dachuan]'s Articles
[Li, Min]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ji, Sai]'s Articles
[Xu, Dachuan]'s Articles
[Li, Min]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ji, Sai]'s Articles
[Xu, Dachuan]'s Articles
[Li, Min]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.