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 条
  • [21] A PRIMAL-DUAL ALGORITHM FOR BSDES
    Bender, Christian
    Schweizer, Nikolaus
    Zhuo, Jia
    [J]. MATHEMATICAL FINANCE, 2017, 27 (03) : 866 - 901
  • [22] The primal-dual method for approximation algorithms
    Williamson, DP
    [J]. MATHEMATICAL PROGRAMMING, 2002, 91 (03) : 447 - 478
  • [23] An approximation algorithm for the partial vertex cover problem in hypergraphs
    El Ouali, Mourad
    Fohlin, Helena
    Srivastav, Anand
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 846 - 864
  • [24] An approximation algorithm for the partial vertex cover problem in hypergraphs
    Mourad El Ouali
    Helena Fohlin
    Anand Srivastav
    [J]. Journal of Combinatorial Optimization, 2016, 31 : 846 - 864
  • [25] The primal-dual method for approximation algorithms
    David P. Williamson
    [J]. Mathematical Programming, 2002, 91 : 447 - 478
  • [26] Primal-dual RNC approximation algorithms for set cover and covering integer programs
    Rajagopalan, S
    Vazirani, VV
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 526 - 541
  • [27] A primal-dual schema based approximation algorithm for the element connectivity problem
    Jain, K
    Mandoiu, I
    Vazirani, VV
    Williamson, DP
    [J]. PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 484 - 489
  • [28] Improved primal-dual approximation algorithm for the Connected Facility Location problem
    Jung, Hyunwoo
    Hasan, Mohammad Khairul
    Chwa, Kyung-Yong
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2008, 5165 : 265 - 277
  • [29] A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
    Viet Hung Nguyen
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 265 - 278
  • [30] A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
    Viet Hung Nguyen
    [J]. Journal of Combinatorial Optimization, 2013, 25 : 265 - 278
12345