Skip to main content
SpringerLink
Log in

Fractional Packing and Covering Problems

1991; Plotkin, Shmoys, Tardos 1995; Plotkin, Shmoys, Tardos

  • Reference work entry
Encyclopedia of Algorithms

  • 334 Accesses

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 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4, 86–107 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Held, M., Karp, R.M.: The traveling‐salesman problem and minimum cost spanning trees. Oper. Res. 18, 1138–1162 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  3. Karger, D.R., Stein, C.: An \( { \tilde{O}(n^2) } \) algorithm for minimum cut. In: Proceeding of 25th Annual ACM Symposium on Theory of Computing (STOC), 1993, pp. 757–765

    Google Scholar 

  4. Leighton, F.T., Makedon, F., Plotkin, S.A., Stein, C., Tardos, É., Tragoudas, S.: Fast approximation algorithms for multicommodity flow problems. J. Comp. Syst. Sci. 50(2), 228–243 (1995)

    Google Scholar 

  5. Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. Ser. A 24, 259–272 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. In: Proceedings of 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1991, pp. 495–504

    Google Scholar 

  7. Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20(2) 257–301 (1995). Preliminary version appeared in [6]

    Google Scholar 

  8. Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37, 318–334 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 538–546

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing & Software, McMaster University, Hamilton, ON, Canada

    George Karakostas

Authors
  1. George Karakostas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Karakostas, G. (2008). Fractional Packing and Covering Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_149

Download citation

Publish with us

Policies and ethics

Search

Navigation