Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Erratum: Resource Minimization Job Scheduling

  • Erratum
  • Conference paper

Abstract

A claim on page 75 of this paper, stating thatJ = J1 ∪ … ∪ Jk 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 athttp://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

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Supported in part by NSF CAREER award CCF-0844872, Toyota Technological Institute, Chicago, IL, 60637, USA

    Julia Chuzhoy

  2. Department of Computer Science, University of Chicago, Chicago, IL, 60637, USA

    Paolo Codenotti

Authors
  1. Julia Chuzhoy

    You can also search for this author inPubMed Google Scholar

  2. Paolo Codenotti

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Applied Math and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel

    Irit Dinur

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Technion, Computer Science Department, 32000, Haifa, Israel

    Joseph Naor

  4. University of Geneva, Centre Universitaire d’Informatique, Battelle Bat. A, 7 rte de Drize, 1227, Carouge, Switzerland

    José Rolim

Rights 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

Publish with us


[8]ページ先頭

©2009-2025 Movatter.jp