Corrigendum: Improved results for data migration and open shop scheduling

Rajiv Gandhi; Magnús M. Halldórsson; Guy Kortsarz; Hadas Shachnai

doi:10.1145/2500123

Corrigendum: Improved results for data migration and open shop scheduling

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Research output: Contribution to journal › Article › peer-review

Abstract

In Gandhi et al. [2006], we gave an algorithm for the data migration and non-deterministic open shop scheduling problems in the minimum sum version, that was claimed to achieve a 5.06-approximation. Unfortunately, it was pointed to us by Maxim Sviridenko that the argument contained an unfounded assumption that has eluded all of its readers until now. We detail in this document how this error can be amended. A side effect is an improved approximation ratio of 4.96.

Original language	English
Article number	34
Journal	ACM Transactions on Algorithms
Volume	9
Issue number	4
DOIs	https://doi.org/10.1145/2500123
State	Published - 2013
Externally published	Yes

Keywords

Approximation algorithms
Data migration
LP rounding
Linear programming
Open shop
Scheduling

Access to Document

10.1145/2500123

Cite this

@article{6f83d79b71874db58d726f1428546a04,

title = "Corrigendum: Improved results for data migration and open shop scheduling",

abstract = "In Gandhi et al. [2006], we gave an algorithm for the data migration and non-deterministic open shop scheduling problems in the minimum sum version, that was claimed to achieve a 5.06-approximation. Unfortunately, it was pointed to us by Maxim Sviridenko that the argument contained an unfounded assumption that has eluded all of its readers until now. We detail in this document how this error can be amended. A side effect is an improved approximation ratio of 4.96.",

keywords = "Approximation algorithms, Data migration, LP rounding, Linear programming, Open shop, Scheduling",

author = "Rajiv Gandhi and Halld{\'o}rsson, {Magn{\'u}s M.} and Guy Kortsarz and Hadas Shachnai",

year = "2013",

doi = "10.1145/2500123",

language = "אנגלית",

volume = "9",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - Corrigendum

T2 - Improved results for data migration and open shop scheduling

AU - Gandhi, Rajiv

AU - Halldórsson, Magnús M.

AU - Kortsarz, Guy

AU - Shachnai, Hadas

PY - 2013

Y1 - 2013

N2 - In Gandhi et al. [2006], we gave an algorithm for the data migration and non-deterministic open shop scheduling problems in the minimum sum version, that was claimed to achieve a 5.06-approximation. Unfortunately, it was pointed to us by Maxim Sviridenko that the argument contained an unfounded assumption that has eluded all of its readers until now. We detail in this document how this error can be amended. A side effect is an improved approximation ratio of 4.96.

AB - In Gandhi et al. [2006], we gave an algorithm for the data migration and non-deterministic open shop scheduling problems in the minimum sum version, that was claimed to achieve a 5.06-approximation. Unfortunately, it was pointed to us by Maxim Sviridenko that the argument contained an unfounded assumption that has eluded all of its readers until now. We detail in this document how this error can be amended. A side effect is an improved approximation ratio of 4.96.

KW - Approximation algorithms

KW - Data migration

KW - LP rounding

KW - Linear programming

KW - Open shop

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=84885678122&partnerID=8YFLogxK

U2 - 10.1145/2500123

DO - 10.1145/2500123

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84885678122

SN - 1549-6325

VL - 9

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 4

M1 - 34

ER -

Corrigendum: Improved results for data migration and open shop scheduling

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this