A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses

被引：0
|
作者：
Julián Mestre
机构：
[1] University of Maryland,Department of Computer Science
来源：
Algorithmica | 2009年 / 55卷
关键词：
Approximation algorithms; Vertex cover; Primal-dual algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study the partial vertex cover problem. Given a graph G=(V,E), a weight function w:V→R+, and an integer s, our goal is to cover all but s edges, by picking a set of vertices with minimum weight. The problem is clearly NP-hard as it generalizes the well-known vertex cover problem. We provide a primal-dual 2-approximation algorithm which runs in O(nlog n+m) time. This represents an improvement in running time from the previously known fastest algorithm.
引用
收藏
页码：227 / 239
页数：12
相关论文
共 50 条
  • [1] A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
    Mestre, Julian
    [J]. ALGORITHMICA, 2009, 55 (01) : 227 - 239
  • [2] A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
    Mestre, J
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 182 - 191
  • [3] A primal-dual approximation algorithm for the vertex cover P3 problem
    Tu, Jianhua
    Zhou, Wenli
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (50) : 7044 - 7048
  • [4] A primal-dual bicriteria distributed algorithm for capacitated vertex cover
    Grandoni, F.
    Koenemann, J.
    Panconesi, A.
    Sozio, M.
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 825 - 840
  • [5] A primal-dual algorithm for the minimum power partial cover problem
    Menghong Li
    Yingli Ran
    Zhao Zhang
    [J]. Journal of Combinatorial Optimization, 2022, 44 : 1913 - 1923
  • [6] A primal-dual algorithm for the minimum power partial cover problem
    Li, Menghong
    Ran, Yingli
    Zhang, Zhao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1913 - 1923
  • [7] A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
    Liu, Xiaofei
    Li, Weidong
    Yang, Jinhua
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2023, 17 (03)
  • [8] A primal-dual approximation algorithm for MINSAT
    Arif, Umair
    Benkoczi, Robert
    Gaur, Daya Ram
    Krishnamurti, Ramesh
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 319 : 372 - 381
  • [9] Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties
    Xu, Dachuan
    Wang, Fengmin
    Du, Donglei
    Wu, Chenchen
    [J]. COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 336 - 345
  • [10] A primal-dual algorithm for the minimum partial set multi-cover problem
    Ran, Yingli
    Shi, Yishuo
    Tang, Changbing
    Zhang, Zhao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 725 - 746
12345