$k$-Submodular Maximization with a Knapsack Constraint and $p$ Matroid Constraints

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Qian Liu;Kemin Yu;Min Li;Yang Zhou
{"title":"$k$-Submodular Maximization with a Knapsack Constraint and $p$ Matroid Constraints","authors":"Qian Liu;Kemin Yu;Min Li;Yang Zhou","doi":"10.26599/TST.2022.9010039","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":"28 5","pages":""},"PeriodicalIF":5.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5971803/10130021/10130030.pdf","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10130030/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3
带背包约束和$p$Matroid约束的$k$-子模最大化
$k$-子模函数是子模函数的推广,其定义域从单子集的集合扩展到$k$不相交子集的集合。$k$-子模最大化问题有着广泛的应用。本文针对背包约束和$p$拟阵约束下单调$k$-子模函数的最大化问题,提出了一种嵌套贪婪局部搜索算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信