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 条
  • [21] Local ratio method on partial set multi-cover
    Ran, Yingli
    Shi, Yishuo
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 302 - 313
  • [22] Approximation algorithm for the minimum weight connected κ-subgraph cover problem
    Zhang, Yaping
    Shi, Yishuo
    Zhang, Zhao
    THEORETICAL COMPUTER SCIENCE, 2014, 535 : 54 - 58
  • [23] A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem
    Chen, Wenbin
    Li, Fufang
    Qi, Ke
    Liu, Miao
    Tang, Maobin
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2020, 2020, 12337 : 60 - 68
  • [24] Approximation algorithms for minimum weight partial connected set cover problem
    Dongyue Liang
    Zhao Zhang
    Xianliang Liu
    Wei Wang
    Yaolin Jiang
    Journal of Combinatorial Optimization, 2016, 31 : 696 - 712
  • [25] Approximation algorithms for minimum weight partial connected set cover problem
    Liang, Dongyue
    Zhang, Zhao
    Liu, Xianliang
    Wang, Wei
    Jiang, Yaolin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 696 - 712
  • [26] A simple approximation algorithm for minimum weight partial connected set cover
    Zhang, Yubai
    Ran, Yingli
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 956 - 963
  • [27] A simple approximation algorithm for minimum weight partial connected set cover
    Yubai Zhang
    Yingli Ran
    Zhao Zhang
    Journal of Combinatorial Optimization, 2017, 34 : 956 - 963
  • [28] An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
    Dai, Han
    COMPUTATION, 2022, 10 (10)
  • [29] A primal-dual algorithm for the minimum power partial cover problem
    Menghong Li
    Yingli Ran
    Zhao Zhang
    Journal of Combinatorial Optimization, 2022, 44 : 1913 - 1923
  • [30] A primal-dual algorithm for the minimum power partial cover problem
    Li, Menghong
    Ran, Yingli
    Zhang, Zhao
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1913 - 1923
12345