首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Maximizing k-submodular functions under budget constraint: applications and streaming algorithms
Authors:Pham  Canh V  Vu  Quang C  Ha  Dung K T  Nguyen  Tai T  Le  Nguyen D
Institution:1.ORlab, Faculty of Computer Science, Phenikaa University, Hanoi, 12116, Vietnam
;2.Faculty of Information Security, People’s Security Academy, Hanoi, 10000, Vietnam
;3.Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 10000, Vietnam
;4.Haiphong University, Haiphong, 180000, Vietnam
;
Abstract:Journal of Combinatorial Optimization - Motivated by the practical applications in solving plenty of important combinatorial optimization problems, this paper investigates the Budgeted k-Submodular...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号