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 条
  • [31] A Genetic Algorithm for the Minimum Vertex Cover Problem with Interval-Valued Fitness
    Nagy, Benedek
    Szokol, Peter
    ACTA POLYTECHNICA HUNGARICA, 2021, 18 (04) : 105 - 123
  • [32] Approximation algorithm for the minimum partial connected Roman dominating set problem
    Zhang, Yaoyao
    Zhang, Zhao
    Du, Ding-Zhu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (04)
  • [33] A novel approximation algorithm for minimum geometric disk cover problem with hexagon tessellation
    Department of Information Engineering, I-Shou University, Kaohsiung City 84001, Taiwan
    Smart Innov. Syst. Technol., 2013, (157-166):
  • [34] Approximation Algorithm for the Minimum Connected k-Path Vertex Cover Problem
    Li, Xiaosong
    Zhang, Zhao
    Huang, Xiaohui
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 2014, 8881 : 764 - 771
  • [35] A better-than-greedy approximation algorithm for the minimum set cover problem
    Hassin, R
    Levin, A
    SIAM JOURNAL ON COMPUTING, 2005, 35 (01) : 189 - 200
  • [36] Clever Steady Strategy Algorithm: A simple and efficient approximation algorithm for minimum vertex cover problem
    Fayaz, Muhammad
    Arshad, Shakeel
    2015 13TH INTERNATIONAL CONFERENCE ON FRONTIERS OF INFORMATION TECHNOLOGY (FIT), 2015, : 277 - 282
  • [37] Approximation to the minimum rooted star cover problem
    Zhao, Wenbo
    Zhang, Peng
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 670 - +
  • [38] Approximation Algorithm for the Minimum Directed Tree Cover
    Viet Hung Nguyen
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 144 - 159
  • [39] The Multi-Cover Persistence of Euclidean Balls
    Edelsbrunner, Herbert
    Osang, Georg
    DISCRETE & COMPUTATIONAL GEOMETRY, 2021, 65 (04) : 1296 - 1313
  • [40] The Multi-Cover Persistence of Euclidean Balls
    Herbert Edelsbrunner
    Georg Osang
    Discrete & Computational Geometry, 2021, 65 : 1296 - 1313
12345