Primal-dual RNC approximation algorithms for set cover and covering integer programs

被引:0
|
作者
Rajagopalan, S
Vazirani, VV
机构
[1] Princeton Univ, DIMACS, Princeton, NJ 08544 USA
[2] Univ Calif Berkeley, Berkeley, CA 94720 USA
[3] Indian Inst Technol, Delhi, India
[4] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
关键词
algorithms; set cover; primal-dual; parallel; approximation; voting lemmas;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for the generalizations considered in this paper.
引用
收藏
页码:526 / 541
页数:16
相关论文
共 50 条
  • [1] Primal-dual approximation algorithms for a packing-covering pair of problems
    Kovaleva, S
    Spieksma, FCR
    [J]. RAIRO-OPERATIONS RESEARCH, 2002, 36 (01) : 53 - 71
  • [2] PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR SUBMODULAR COST SET COVER PROBLEMS WITH LINEAR/SUBMODULAR PENALTIES
    Wang, Fengmin
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    [J]. NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (02): : 91 - 100
  • [3] The primal-dual method for approximation algorithms
    Williamson, DP
    [J]. MATHEMATICAL PROGRAMMING, 2002, 91 (03) : 447 - 478
  • [4] Online Primal-Dual Algorithms for Covering and Packing
    Buchbinder, Niv
    Naor, Joseph
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (02) : 270 - 286
  • [5] The primal-dual method for approximation algorithms
    David P. Williamson
    [J]. Mathematical Programming, 2002, 91 : 447 - 478
  • [6] Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
    Elbassioni, Khaled
    Makino, Kazuhisa
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [7] Primal-dual schema based approximation algorithms
    Vazirani, VV
    [J]. COMPUTING AND COMBINATORICS, 1995, 959 : 650 - 652
  • [8] Primal-dual schema based approximation algorithms
    Vazirani, VV
    [J]. THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2002, 2292 : 198 - 207
  • [9] Online primal-dual algorithms for covering and packing problems
    Buchbinder, N
    Naor, J
    [J]. ALGORITHMS - ESA 2005, 2005, 3669 : 689 - 701
  • [10] Primal-Dual Algorithms for Precedence Constrained Covering Problems
    Wierz, Andreas
    Peis, Britta
    McCormick, S. Thomas
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 260 - 272