Skip to main content
SpringerLink
Log in

Minimum Congestion Redundant Assignments

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 68 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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Fotakis D, Spirakis P (2002) Minimum congestion redundant assignments to tolerate random faults. Algorithmica 32:396–422

    Article  MathSciNet  MATH  Google Scholar 

  2. Gasieniec L, Kranakis E, Krizanc D, Pelc A (1996) Minimizing congestion of layouts for ATM networks with faulty links. In: Penczek W, Szalas A (eds) Proceedings of the 21st international symposium on mathematical foundations of computer science. Lecture notes in computer science, vol 1113. Springer, Berlin, pp 372–381

    Google Scholar 

  3. Karger D (1999) A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J Comput 29:492–514

    Article  MathSciNet  MATH  Google Scholar 

  4. Kleinberg J, Rabani Y, Tardos E (2000) Allocating bandwidth for bursty connections. SIAM J Comput 30:191–217

    Article  MathSciNet  MATH  Google Scholar 

  5. Lomonosov M (1974) Bernoulli scheme with closure. Probl Inf Transm 10:73–81

    MathSciNet  MATH  Google Scholar 

  6. Toda S, Watanabe O (1992) Polynomial-time 1-turing reductions from #PH to #P. Theor Comput Sci 100:205–221

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece

    Dimitris Fotakis

  2. Computer Engineering and Informatics, Research and Academic Computer Technology Institute, Patras University, Patras, Greece

    Paul (Pavlos) Spirakis

  3. Computer Science, University of Liverpool, Liverpool, UK

    Paul (Pavlos) Spirakis

  4. Computer Technology Institute (CTI), Patras, Greece

    Paul (Pavlos) Spirakis

Authors
  1. Dimitris Fotakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul (Pavlos) Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dimitris Fotakis .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Fotakis, D., Spirakis, P.(. (2016). Minimum Congestion Redundant Assignments. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_232

Download citation

Publish with us

Policies and ethics

Search

Navigation