Skip to main content

Abstract

A claim on page 75 of this paper, stating that J = J 1 ∪ … ∪ J k was found to be incorrect, invalidating the main result of the paper. The best current approximation ratio for this problem therefore remains \(O(\sqrt{log~n/log~log~n})\). We thank Kirk Pruhs for pointing this error out to us.

The original online version for this chapter can be found at http://dx.doi.org/10.1007/978-3-642-03685-9_6

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chuzhoy, J., Codenotti, P. (2009). Erratum: Resource Minimization Job Scheduling. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2009 2009. Lecture Notes in Computer Science, vol 5687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03685-9_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03685-9_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03684-2

  • Online ISBN: 978-3-642-03685-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics