SUBMODULARITY

作品数：8被引量：1H指数：1
导出分析报告
相关领域：自动化与计算机技术更多>>
相关期刊：《Frontiers of Computer Science》《国际计算机前沿大会会议论文集》《Journal of the Operations Research Society of China》《Tsinghua Science and Technology》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Greedy is Good:Constrained Non-submodular Function Maximization via Weak Submodularity
《Journal of the Operations Research Society of China》2024年第3期627-648,共22页Ma-Jun Shi Wei Wang 
supported by the National Natural Science Foundation of China(No.11971376).
The widely used greedy algorithm has been recently shown to achieve near-optimal theoretical guarantees for the problems of constrained monotone non-submodular function maximization,with competitive performances in pr...
关键词：Non-submodular function p-matroid intersection p-extendible system P-SYSTEM Greedy algorithm 
k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints
《Tsinghua Science and Technology》2023年第5期896-905,共10页Qian Liu Kemin Yu Min Li Yang Zhou 
supported by the Natural Science Foundation of Shandong Province of China(Nos.ZR2020MA029,ZR2021MA100);the National Natural Science Foundation of China(No.12001335).
A k-submodular function is a generalization of a submodular function,its definition domain is extended from the collection of single subsets to the collection of k disjoint subsets.The k-submodular maximization proble...
关键词：k-submodularity knapsack constraint matroid constraint approximation algorithm 
A Note on Submodularity Preserved Involving the Rank Functions
《Journal of the Operations Research Society of China》2019年第3期399-407,共9页Min Li Dong-Lei Du Da-Chuan Xu Zhen-Ning Zhang 
supported by Higher Educational Science and Technology Program of Shandong Province(No.J17KA171);Natural Science and Engineering Research Council of Canada(No.06446);the National Natural Science Foundation of China(No.11871081);Science and Technology Program of Beijing Education Commission(No.KM201810005006).
In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matr...
关键词：MATROID Submodular function Rank function Convexclosure GAME 
Performance bounds for Nash equilibria in submodular utility systems with user groups
《Journal of Control and Decision》2018年第1期1-18,共18页Yajing Liu Edwin K.P.Chong Ali Pezeshki 
NSF and Division of Computing and Communication Foundations[grant number CCF-1422658];the CSU Information Science and Technology Center(ISTeC)。
It is shown that for a valid non-cooperative utility system,if the social utility function is submodular,then any Nash equilibrium achieves at least 1/2 of the optimal social utility,subject to a function-dependent ad...
关键词：Group Nash equilibrium social-aware Nash equilibrium SUBMODULARITY utility system 
Structural Properties in a Hub-to-Hub Network Revenue Management Problem
《Journal of the Operations Research Society of China》2016年第4期503-516,共14页Hong-Zhi He 
the Startup Grant of Scientific Research for Doctors of Luoyang Institute of Science and Technology,China(No.2011BZ12).
In this paper,the structural properties of revenue management in a hubto-hub airline network is studied.Using a reformulated network flow version of the problem,it is shown that the optimal value has supermodularity,s...
关键词：Revenue management Hub-to-hub network Certainty equivalent control Super/submodularity Lconcavity Monotone thresholds 
Selecting Seeds for Competitive Influence Spread Maximization in Social Networks
《国际计算机前沿大会会议论文集》2016年第1期153-155,共3页Hong Wu Weiyi Liu Kun Yue Jin Li Weipeng Huang 
This paper was supported by the National Natural Science Foundation of China (61472345, 61562091), the Natural Science Foundation of Yunnan Province (2014FA023,2013FB010), the Program for Innovative Research Team in Yunnan University (XT412011), the Program for Excellent Young Talents of Yunnan University (XT412003), Yunnan Provincial Foundation for Leaders of Disciplines in Science and Technology (2012HB004), and the Research Foundation of the Educational Department of Yunnan Province (2014C134Y).
There exist two or more competing products in viral marketing, and the companies can exploit the social interactions of users to propagate the awareness of products. In this paper, we focus on selecting seeds for maxi...
关键词：Social networks COMPETITIVE INFLUENCE SPREAD Possible graph SUBMODULARITY CELF algorithm 
Influence Maximization for Cascade Model with Diffusion Decay in Social Networks
《国际计算机前沿大会会议论文集》2016年第1期106-108,共3页Zhijian Zhang Hong Wu Kun Yue Jin Li Weiyi Liu 
This paper was supported by the National Natural Science Foundation of China (61562091), Natural Science Foundation of Yunnan Province (2014FA023,201501CF00022), Program for Innovative Research Team in Yunnan University (XT412011), and Program for Excellent Young Talents of Yunnan University (XT412003).
Maximizing the spread of influence is to select a set of seeds with specified size to maximize the spread of influence under a certain diffusion model in a social network. In the actual spread process, the activated p...
关键词：Social networks INFLUENCE MAXIMIZATION Cascade model DIFFUSION DECAY SUBMODULARITY GREEDY algorithm 
Optimizing top-k retrieval： submodularity analysis and search strategies被引量：1
《Frontiers of Computer Science》2016年第3期477-487,共11页Chaofeng SHA Keqiang WANG Dell ZHANG Xiaoling WANG Aoying ZHOU 
This work was supported by the National Natural Science Foundation of China （Grant Nos. 61572135 and 61170085）, 973 project （2010CB328106）, Program for New Century Excellent Talents in China （NCET-10-0388）.
The key issue in top-k retrieval, finding a set of k documents （from a large document collection） that can best answer a user＇s query, is to strike the optimal balance between relevance and diversity. In this paper...
关键词：top-k retrieval DIVERSIFICATION submodular function maximization 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部