发表状态 | 已发表Published |
题名 | On maximizing a monotone k-submodular function under a knapsack constraint |
作者 | |
发表日期 | 2022 |
发表期刊 | Operations Research Letters
![]() |
ISSN/eISSN | 0167-6377 |
卷号 | 50期号:1页码:28-31 |
摘要 | We study the problem of maximizing a non-negative monotone k-submodular function f under a knapsack constraint, where a k-submodular function is a natural generalization of a submodular function to k dimensions. We present a deterministic [Formula presented]-approximation algorithm that evaluates f O(nk) times, based on the result of Sviridenko (2004) on submodular knapsack maximization. |
关键词 | Approximation algorithms k-Submodularity Knapsack |
DOI | 10.1016/j.orl.2021.11.010 |
URL | 查看来源 |
收录类别 | SCIE |
语种 | 英语English |
WOS研究方向 | Operations Research & Management Science |
WOS类目 | Operations Research & Management Science |
WOS记录号 | WOS:000729320500004 |
Scopus入藏号 | 2-s2.0-85120868477 |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/8288 |
专题 | 理工科技学院 |
通讯作者 | Wang, Chenhao |
作者单位 | 1.School of Science,Beijing University of Posts and Telecommunications,Beijing,China 2.Advanced Institute of Natural Sciences,Beijing Normal University,Zhuhai,China 3.BNU-HKBU United International College,Zhuhai,China 4.Department of Computer Science and Engineering,University of Nebraska,Lincoln,United States |
通讯作者单位 | 北师香港浸会大学 |
推荐引用方式 GB/T 7714 | Tang, Zhongzheng,Wang, Chenhao,Chan, Hau. On maximizing a monotone k-submodular function under a knapsack constraint[J]. Operations Research Letters, 2022, 50(1): 28-31. |
APA | Tang, Zhongzheng, Wang, Chenhao, & Chan, Hau. (2022). On maximizing a monotone k-submodular function under a knapsack constraint. Operations Research Letters, 50(1), 28-31. |
MLA | Tang, Zhongzheng,et al."On maximizing a monotone k-submodular function under a knapsack constraint". Operations Research Letters 50.1(2022): 28-31. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论