Approximation Algorithm for the Minimum Interval Partial Multi-Cover Problem

被引：0
|
作者：
Ran, Yingli [1 ]
Jin, Jianhong [1 ]
Zhang, Zhao [1 ]
机构：
[1] Zhejiang Normal Univ, Sch Math Sci, Jinhua, Zhejiang, Peoples R China
来源：
NETWORKS | 2024年
关键词：
approximation algorithm; interval cover; partial set multi-cover; densest k subgraph;
D O I：
10.1002/net.22263
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a set of points on a line, a set of intervals along the line and an integer k, each point p is associated with a covering requirement cr(p), the goal of the minimum interval partial multi-cover (MinIPMC) problem is to select the minimum number of intervals to fully cover at least k points, where a point p is fully covered if it belongs to at least cr(p) selected intervals. This paper presents a 2-approximation algorithm for the MinIPMC problem.
引用
收藏
页数：6
相关论文
共 50 条
  • [1] Approximation algorithm for the partial set multi-cover problem
    Shi, Yishuo
    Ran, Yingli
    Zhang, Zhao
    Willson, James
    Tong, Guangmo
    Du, Ding-Zhu
    JOURNAL OF GLOBAL OPTIMIZATION, 2019, 75 (04) : 1133 - 1146
  • [2] Approximation algorithm for the partial set multi-cover problem
    Yishuo Shi
    Yingli Ran
    Zhao Zhang
    James Willson
    Guangmo Tong
    Ding-Zhu Du
    Journal of Global Optimization, 2019, 75 : 1133 - 1146
  • [3] Approximation algorithm for minimum partial multi-cover under a geometric setting
    Yingli Ran
    Xiaohui Huang
    Zhao Zhang
    Ding-Zhu Du
    Optimization Letters, 2022, 16 : 667 - 680
  • [4] Approximation algorithm for minimum partial multi-cover under a geometric setting
    Ran, Yingli
    Huang, Xiaohui
    Zhang, Zhao
    Du, Ding-Zhu
    OPTIMIZATION LETTERS, 2022, 16 (02) : 667 - 680
  • [5] A primal-dual algorithm for the minimum partial set multi-cover problem
    Ran, Yingli
    Shi, Yishuo
    Tang, Changbing
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 725 - 746
  • [6] A primal-dual algorithm for the minimum partial set multi-cover problem
    Yingli Ran
    Yishuo Shi
    Changbing Tang
    Zhao Zhang
    Journal of Combinatorial Optimization, 2020, 39 : 725 - 746
  • [7] A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
    Shi, Yishuo
    Ran, Yingli
    Zhang, Zhao
    Du, Ding-Zhu
    THEORETICAL COMPUTER SCIENCE, 2020, 803 : 1 - 9
  • [8] Minimum power partial multi-cover on a line
    Liang, Wei
    Li, Menghong
    Zhang, Zhao
    Huang, Xiaohui
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 118 - 128
  • [9] Primal Dual Algorithm for Partial Set Multi-cover
    Ran, Yingli
    Shi, Yishuo
    Zhang, Zhao
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 372 - 385
  • [10] An Approximation Algorithm for the Minimum Vertex Cover Problem
    Chen, Jingrong
    Kou, Lei
    Cui, Xiaochuan
    GREEN INTELLIGENT TRANSPORTATION SYSTEM AND SAFETY, 2016, 138 : 180 - 185
12345