Advertisement

Set Cover via the Primal-Dual Schema

  • Vijay V. Vazirani

Abstract

As noted in Section 12.3, the primal-dual schema is the method of choice for designing approximation algorithms since it yields combinatorial algorithms with good approximation factors and good running times. We will first present the central ideas behind this schema and then use it to design a simple f factor algorithm for set cover, where f is the frequency of the most frequent element.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 186.
    H.W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2: 83–97, 1955.MathSciNetCrossRefGoogle Scholar
  2. 63.
    G.B. Dantzig, L.R. Ford, and D.R. Fulkerson. A primal-dual algorithm for linear programs. In H.W. Kuhn and A.W. Tucker, editors, Linear Inequalities and Related Systems, pages 171–181. Princeton University Press, Princeton, NJ, 1956.Google Scholar
  3. 21.
    R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2: 198–203, 1981.MathSciNetCrossRefGoogle Scholar
  4. 1.
    A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner network problem on networks. SIAM Journal on Computing, 24: 440–456, 1995.MathSciNetCrossRefGoogle Scholar
  5. 111.
    M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24: 296–317, 1995.MathSciNetCrossRefGoogle Scholar
  6. 266.
    D.P. Williamson, M.X. Goemans, M. Mihail, and V.V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15: 435–454, 1995.MathSciNetCrossRefGoogle Scholar
  7. 113.
    M.X. Goemans and D.P. Williamson. The primal—dual method for approximation algorithms and its applications to network design problems. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 144–191. PWS Publishing, Boston, MA, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations