Journal of Combinatorial Optimization

, Volume 8, Issue 3, pp 307–328 | Cite as

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

  • A.A. Ageev
  • M.I. Sviridenko
Article

Abstract

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.

approximation algorithm performance guarantee linear relaxation rounding technique maximum coverage max cut 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.A. Ageev and M.I. Sviridenko, “Approximation algorithms for maximum coverage and Max Cut with given sizes of parts,” Lecture Notes in Computer Science (Proceedings of IPCO'99), vol. 1610, pp. 17–30, 1999.Google Scholar
  2. A.A. Ageev and M.I. Sviridenko, “An approximation algorithm for Hypergraph Max k-Cut with given sizes of parts,” Lecture Notes in Computer Science (Proceedings of ESA'2000), vol. 1879, pp. 32–41, 2000.Google Scholar
  3. G. Andersson, “An approximation algorithm for Max p-Section,” Lecture Notes in Computer Science (Proceedings of STACS'99), vol. 1563, pp. 237–247, 1999.Google Scholar
  4. G. Andersson and L. Engebretsen, “Better approximation algorithms for Set splitting and Not-All-Equal SAT,” Inform. Process. Letters, vol. 65, pp. 305–311, 1998.CrossRefGoogle Scholar
  5. S. Arora, D. Karger, and M. Karpinski, “Polynomial time approximation schemes for dense instances of NP-hard problems,” Journal of Computer and System Science, vol. 58, pp. 193–210, 1999.CrossRefGoogle Scholar
  6. R. Bar-Yehuda and S. Even, “A linear-time approximation algorithm for the weighted vertex cover problem,” J. Algorithms, vol. 2, pp. 198–203, 1981.Google Scholar
  7. G. Cornuejols, M.L. Fisher, and G.L. Nemhauser, “Location of bank accounts to optimize float: An analytic study exact and approximate algorithms,” Management Science, vol. 23, pp. 789–810, 1977.Google Scholar
  8. G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey, “Worst-case and probabilistic analysis of algorithms for a location problem,” Operations Research, vol. 28, pp. 847–858, 1980.Google Scholar
  9. U. Feige, “A threshold of ln n for approximating set cover,” J. of ACM., vol. 45, pp. 634–652, 1998.CrossRefGoogle Scholar
  10. A. Frieze and M. Jerrum, “Improved approximation algorithms for MAX k-CUT and MAX BISECTION,” Algorithmica, vol. 18, pp. 67–81, 1997.Google Scholar
  11. M. Grötschel, L. Lovasz, and A. Schrijver, “Geometric algorithms and combinatorial optimization, ser,” Algorithms and Combinatorics, vol. 2, Springer-Verlag, 1988.Google Scholar
  12. F. Granot, J. Skorin-Kapov, and A. Tamir, “Using quadratic programming to solve high multiplicity scheduling problems on parallel machines,” Algorithmica, vol. 17, pp. 100–110, 1997.Google Scholar
  13. M.X. Goemans and D.P.Williamson, “New3/4-approximation algorithms forMAXSAT,” SIAM J. Discrete Math., vol. 7, pp. 656–666, 1994.Google Scholar
  14. D.S. Hochbaum, “Approximation algorithms for the set covering and vertex cover problems,” SIAM J. on Computing, vol. 11, pp. 555–556, 1982.Google Scholar
  15. D.S. Hochbaum, “Approximating covering and packing problems: Set Cover, Vertex Cover, Independent Set, and related problems,” in Approximation algorithms for NP-hard problems, D.S. Hochbaum (Ed.), PWS Publishing Company: New York, 1997, pp. 94–143.Google Scholar
  16. S. Khuller, A. Moss, and J. Naor, “The budgeted maximum coverage problem,” Information Processing Letters, vol. 70, pp. 39–45, 1999.CrossRefGoogle Scholar
  17. S. Sahni, “Approximate algorithms for the 0-1 knapsack problem,” J. of ACM, vol. 22, pp. 115–124, 1975.CrossRefGoogle Scholar
  18. J. Sethuraman and M.S. Squillante, “Optimal scheduling of multiclass parallel machines,” in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 963–964.Google Scholar
  19. M. Skutella, “Semidefinite relaxations for parallel machine scheduling,” in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 472–481.Google Scholar
  20. M. Skutella, “Convex quadratic and semidefinite programming relaxations in scheduling,” J. of ACM, vol. 48, pp. 206–242, 2001.CrossRefGoogle Scholar
  21. W.E. Smith, “Various optimizers for single-stage production,” Naval Research and Logistics Quarterly, vol. 3, pp. 59–66, 1956.Google Scholar
  22. L.A. Wolsey, “Maximizing real-valued submodular functions: Primal and dual heuristics for location problems,” Math. Oper. Res., vol. 7, pp. 410–425, 1956.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • A.A. Ageev
    • 1
  • M.I. Sviridenko
    • 2
  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.IBM T.J. Watson Research Center, P.O. Box

Personalised recommendations