A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
<|reference_start|>A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover: The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).<|reference_end|>
@article{khuller2002a,
    title={A Primal-Dual Parallel Approximation Technique Applied to Weighted Set
  and Vertex Cover},
    author={Samir Khuller, Uzi Vishkin, Neal Young},
    journal={Journal of Algorithms 17(2):280-289 (1994)},
    year={2002},
    doi={10.1006/jagm.1994.1036},
    archivePrefix={arXiv},
    eprint={cs/0205037},
    primaryClass={cs.DS cs.DC}
}