当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-08-17 , DOI: 10.1016/j.tcs.2020.08.011
Qingqin Nong; Jiazhu Fang; Suning Gong; Yan Feng; Xiaoying Qu

In this paper we consider the problem of maximizing a non-monotone and non-negative DR-submodular function on a bounded integer lattice [B]={(x1,,xn)Z+n:0xkBk,1kn} without any constraint, where B=(B1,,Bn)Z+n. We design an algorithm for the problem and measure its performance by its approximation ratio and the number of value oracle queries it needs, where the latter one is the dominating term in the running time of an algorithm. It has been showed that, for the problem considered, any algorithm achieving an approximation ratio greater than 12 requires an exponential number of value oracle queries. In the literature there are two algorithms that reach 12 approximation guarantee. The first algorithm needs O(n||B||) oracle queries. The second one reduces its number of oracle queries to O(nmax{1,log||B||}) but it needs large storage. In this paper we present a randomized approximation algorithm that has an approximation guarantee of 12, calls O(nmax{1,log||B||}) oracle queries and does not need large storage, improving the results of the literature.

更新日期:2020-09-15

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
科研绘图
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
张晓晨
田蕾蕾
李闯创
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
清华大学
廖矿标
陈永胜
试剂库存
down
wechat
bug