Two-Stage Submodular Maximization Under Knapsack Problem

Author:

Liu Zhicheng1,Jin Jing2,Du Donglei3,Zhang Xiaoyan4

Affiliation:

1. Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology,Beijing,China,100124

2. College of Taizhou, Nanjing Normal University,Taizhou,China,225300

3. University of New Brunswick,Faculty of Management,Fredericton,Canada,E3B 5A3

4. School of Mathematical Science, Nanjing Normal University, Institute of Mathematics,Ministry of Education Key Laboratory of NSLSCS,Nanjing,China,210023

Funder

National Natural Science Foundation of China

Natural Sciences and Engineering Research Council of Canada

Natural Science Foundation of Jiangsu Province

Qinglan Project

Publisher

Tsinghua University Press

Reference14 articles.

1. Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints

2. Learning sparse combinatorial representations via two-stage submodular maximization;Balkanski

3. Data summarization at scale: A two-stage submodular approach;Mitrovic;arXiv preprint,2018

4. Probabilistic submodular maximization in sub-linear time;Stan

5. A constrained two-stage submodular maximization

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3