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 条
  • [41] A SIMPLE LP-FREE APPROXIMATION ALGORITHM FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
    GONZALEZ, TF
    INFORMATION PROCESSING LETTERS, 1995, 54 (03) : 129 - 131
  • [42] AN IMPROVED APPROXIMATION ALGORITHM FOR THE k-PRIZE-COLLECTING MINIMUM POWER COVER PROBLEM
    Wang, Wencheng
    Cheng, Binhui
    Li, Jianglin
    Chen, Yinhua
    Zhang, Tongquan
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (04) : 1703 - 1718
  • [43] New Approximation Algorithms for the Minimum Cycle Cover Problem
    Yu, Wei
    Liu, Zhaohui
    Bao, Xiaoguang
    FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 81 - 95
  • [44] New approximation algorithms for the minimum cycle cover problem
    Yu, Wei
    Liu, Zhaohui
    Bao, Xiaoguang
    THEORETICAL COMPUTER SCIENCE, 2019, 793 : 44 - 58
  • [45] An Approximation Algorithm for Minimum Vertex Cover on General Graphs
    Li, Shaohua
    Wang, Jianxin
    Chen, Jianer
    Wang, Zhijian
    THIRD INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY WORKSHOPS (ISECS 2010), 2010, : 249 - 252
  • [46] A novel parameterised approximation algorithm for MINIMUM VERTEX COVER
    Brankovic, Ljiljana
    Fernau, Henning
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 85 - 108
  • [47] An effective algorithm for the minimum set cover problem
    Zhang, Pei
    Wang, Rong-Long
    Wu, Chong-Guang
    Okazaki, Kozo
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 3032 - +
  • [48] An Optimal Algorithm for the Minimum Disc Cover Problem
    Min-Te Sun
    Chih-Wei Yi
    Chuan-Kai Yang
    Ten-Hwang Lai
    Algorithmica, 2008, 50 : 58 - 71
  • [49] An Exact Algorithm for Minimum Vertex Cover Problem
    Wang, Luzhi
    Hu, Shuli
    Li, Mingyang
    Zhou, Junping
    MATHEMATICS, 2019, 7 (07)
  • [50] An optimal algorithm for the minimum disc cover problem
    Sun, Min-Te
    Yi, Chih-Wei
    Yang, Chuan-Kai
    Lai, Ten-Hwang
    ALGORITHMICA, 2008, 50 (01) : 58 - 71
12345