咨询与建议

限定检索结果

文献类型

  • 5 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 6 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 理学
    • 5 篇 数学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 3 篇 工学
    • 3 篇 计算机科学与技术...
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 6 篇 bicriteria algor...
  • 2 篇 matroid constrai...
  • 2 篇 approximately su...
  • 1 篇 multiplicative n...
  • 1 篇 approximation ra...
  • 1 篇 submodular cover
  • 1 篇 cardinality cons...
  • 1 篇 energy consumpti...
  • 1 篇 partial cover
  • 1 篇 partial set mult...
  • 1 篇 multi-cover
  • 1 篇 minimum densest ...
  • 1 篇 approximation al...
  • 1 篇 submodular minus...
  • 1 篇 linear additive
  • 1 篇 dynamic programm...
  • 1 篇 sweep cover
  • 1 篇 mobile sensor
  • 1 篇 streaming model
  • 1 篇 massive data

机构

  • 2 篇 univ texas dalla...
  • 2 篇 zhejiang normal ...
  • 1 篇 chinese acad sci...
  • 1 篇 acad sinica inst...
  • 1 篇 academy of mathe...
  • 1 篇 chinese acad sci...
  • 1 篇 ocean univ china...
  • 1 篇 zhejiang normal ...
  • 1 篇 school of mathem...
  • 1 篇 xinjiang univ co...
  • 1 篇 univ delaware de...
  • 1 篇 guangxi key lab ...
  • 1 篇 beijing institut...

作者

  • 3 篇 zhang zhao
  • 2 篇 shi yishuo
  • 2 篇 ran yingli
  • 2 篇 du ding-zhu
  • 1 篇 willson james
  • 1 篇 yang xiaoguang
  • 1 篇 tong guangmo
  • 1 篇 wang yijing
  • 1 篇 geng mengxue
  • 1 篇 hongyang zhang
  • 1 篇 fang qizhi
  • 1 篇 yapu zhang
  • 1 篇 xu yicheng
  • 1 篇 gong shufang
  • 1 篇 zhao lei
  • 1 篇 liu bin
  • 1 篇 yijing wang
  • 1 篇 xiaoguang yang

语言

  • 5 篇 英文
  • 1 篇 其他
检索条件"主题词=Bicriteria algorithm"
6 条 记 录,以下是1-10 订阅
排序:
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 803卷 1-9页
作者: Shi, Yishuo Ran, Yingli Zhang, Zhao Du, Ding-Zhu Acad Sinica Inst Informat Sci Taibei 11529 Taiwan Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA
This paper presents a bicriteria approximation algorithm for the minimum submodular cost partial set multi cover problem (SCPSMC), the goal of which is to find a minimum cost subcollection of sets to fully cover q per... 详细信息
来源: 评论
bicriteria algorithms for Approximately Submodular Cover Under Streaming Model
收藏 引用
Tsinghua Science and Technology 2023年 第6期28卷 1030-1040页
作者: Yijing Wang Xiaoguang Yang Hongyang Zhang Yapu Zhang Academy of Mathematics and Systems Science Chinese Academy of SciencesBeijing 100190China School of Mathematics and Statistics Ningbo UniversityNingbo 315211China Beijing Institute for Scientific and Engineering Computing Beijing University of TechnologyBeijing 100124China
In this paper,we mainly investigate the optimization model that minimizes the cost function such that the cover function exceeds a required threshold in the set cover problem,where the cost function is additive linear... 详细信息
来源: 评论
Approximation algorithm for the partial set multi-cover problem
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2019年 第4期75卷 1133-1146页
作者: Shi, Yishuo Ran, Yingli Zhang, Zhao Willson, James Tong, Guangmo Du, Ding-Zhu Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Xinjiang Peoples R China Zhejiang Normal Univ Coll Math & Comp Sci Jinhua 321004 Zhejiang Peoples R China Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA
Partial set cover problem and set multi-cover problem are two generalizations of the set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element s... 详细信息
来源: 评论
algorithm for partial sweep coverage on a line
收藏 引用
DISCRETE APPLIED MATHEMATICS 2024年 359卷 220-228页
作者: Zhao, Lei Zhang, Zhao Zhejiang Normal Univ Sch Math Sci Jinhua 321004 Zhejiang Peoples R China
Sweep cover is a basic issue in wireless sensor networks, which uses mobile sensors to inspect points of interest (PoIs) periodically. There are many studies on the problem assuming that all mobile sensors have a unif... 详细信息
来源: 评论
On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint  1
收藏 引用
15th Annual International Conference on Combinatorial Optimization and Applications (COCOA)
作者: Wang, Yijing Xu, Yicheng Yang, Xiaoguang Chinese Acad Sci Acad Math & Syst Sci Beijing 100190 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China Guangxi Key Lab Cryptog & Informat Secur Guilin 541004 Peoples R China
In this paper, we investigate the problem of maximizing the difference between an approximately submodular function and a non-negative linear function subject to a matroid constraint. This model has widespread applica... 详细信息
来源: 评论
algorithms for maximizing monotone submodular function minus modular function under noise
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第4期45卷 96-96页
作者: Gong, Shufang Liu, Bin Geng, Mengxue Fang, Qizhi Ocean Univ China Sch Math Sci Qingdao 266100 Peoples R China
Submodular function has the property of diminishing marginal gain, and thus it has a wide range of applications in combinatorial optimization and in emerging disciplines such as machine learning and artificial intelli... 详细信息
来源: 评论