Skip to main content
SpringerLink
Log in

Primal-Dual Schema Based Approximation Algorithms

  • Chapter
  • First Online:
Theoretical Aspects of Computer Science (TACSci 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2292))

Included in the following conference series:

Abstract

The primal-dual schema, a general algorithm design method, hasyielded approximation algorithms for a diverse collection of NP-hard problems. Perhaps its most remarkable feature is that despite its generality, it has yielded algorithms with good approximation guarantees as well as good running times. This survey provides some insights into how this comes about as well as a discussion on future work.

Research supported by NSF Grant CCR-9820896

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Agrawal, P. Klein, and R. Ravi. When trees colide: an approximation algorithm for the generalized Steiner network problem on networks. SIAM J. Comp., 24:440–456, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertexco ver problem. J. Algorithms, 2:198–203, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  3. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.

    Google Scholar 

  4. F. Chudak, T. Roughgarden, and D.P. Williamson. Approximate k-msts and k-steiner trees via the primal-dual method and lagrangean relaxation. In Manuscript, 2000.

    Google Scholar 

  5. 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, NJ, 1956. Princeton University Press.

    Google Scholar 

  6. J. Edmonds. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards, B69:125–130, 1965.

    MathSciNet  Google Scholar 

  7. M.X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comp., 24:296–317, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. M.X. Goemans and D.P. Williamson. The primal-dual method for approximation algorithms and its applications to network design problems. pages 144–191, 1997.

    Google Scholar 

  9. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Second edition. Springer-Verlag, Berlin, 1993.

    MATH  Google Scholar 

  11. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. To appear in Combinatorica.

    Google Scholar 

  12. K. Jain and V. V. Vazirani. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. To appear in J. ACM.

    Google Scholar 

  13. K. Jain and V. V. Vazirani. Applications of Approximation Algorithms to Cooperative Games Manuscript, 2000.

    Google Scholar 

  14. H.W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83–97, 1955.

    Article  MathSciNet  Google Scholar 

  15. L. Lovász. An algorithmic theory of numbers, graphs and convexity. CBMS-NSF Regional Conference Series in Applied Mathematics, 50. SIAM, Philadelphia, PA, 1986.

    Google Scholar 

  16. H. J. Prömel and A. Steger. RNC-approximation algorithms for the Steiner problem. In Proc. Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 559–570, Berlin, Germany, 1997. Springer-Verlag.

    Google Scholar 

  17. S. Rajagopalan and V.V. Vazirani. On the bidirected cut relaxation for the metric Steiner tree problem. In Proc. 10th ACM-SIAM Ann. Symp. Discret. Algorithms, pages 742–751, 1999.

    Google Scholar 

  18. V. V. Vazirani. Approximation Algorithms. Springer Verlag, Berlin, To appear, 2001.

    Google Scholar 

  19. 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.

    Article  MATH  MathSciNet  Google Scholar 

  20. L.A. Wolsey. Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study, 13:121–134, 1980.

    MATH  MathSciNet  Google Scholar 

  21. A. Zelikovsky. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica, 9:463–470, 1993.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 30332-0280, Atlanta, GA, USA

    Vijay V. Vazirani

Authors
  1. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran

    Gholamreza B. Khosrovshahi

  2. Dept. of Mathematics & Computer Science, Drexel University, 19104, Philadelphia, PA, USA

    Ali Shokoufandeh

  3. Digital Fountain, Inc., 39151 Civic Center Drive, 94538, Fremont, CA, USA

    Amin Shokrollahi

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Vazirani, V.V. (2002). Primal-Dual Schema Based Approximation Algorithms. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, A. (eds) Theoretical Aspects of Computer Science. TACSci 2000. Lecture Notes in Computer Science, vol 2292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45878-6_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45878-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43328-6

  • Online ISBN: 978-3-540-45878-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation