On maximizing a monotone k-submodular function under a knapsack constraint

doi:10.1016/j.orl.2021.11.010

Details of Research Outputs

Status	已发表Published
Title	On maximizing a monotone k-submodular function under a knapsack constraint
Creator	Tang, Zhongzheng 1; Wang, Chenhao2,3 ; Chan, Hau 4
Date Issued	2022
Source Publication	Operations Research Letters
ISSN	0167-6377
Volume	50 Issue:1 Pages:28-31
Abstract	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.
Keyword	Approximation algorithms k-Submodularity Knapsack
DOI	10.1016/j.orl.2021.11.010
URL	View source
Indexed By	SCIE
Language	英语English
WOS Research Area	Operations Research & Management Science
WOS Subject	Operations Research & Management Science
WOS ID	WOS:000729320500004
Scopus ID	2-s2.0-85120868477
Citation statistics	Cited Times:16[WOS] [WOS Record] [Related Records in WOS]
Document Type	Journal article
Identifier	http://repository.uic.edu.cn/handle/39GCC9TT/8288
Collection	Faculty of Science and Technology
Corresponding Author	Wang, Chenhao
Affiliation	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
Corresponding Author Affilication	Beijing Normal-Hong Kong Baptist University
Recommended Citation 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.

Files in This Item:
There are no files associated with this item.

Related Services

Usage statistics

Google Scholar

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh