TY - JOUR
T1 - On polynomial-time approximation algorithms for the variable length scheduling problem
AU - Czumaj, Artur
AU - Ga̧sieniec, Leszek
AU - Gaur, Daya Ram
AU - Krishnamurti, Ramesh
AU - Rytter, Wojciech
AU - Zito, Michele
PY - 2003/6/13
Y1 - 2003/6/13
N2 - This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1,k2, denoted VLSP(k1,k2). In the current paper, we first discuss an error in the analysis of one of the approximation algorithms described in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582), where an approximation algorithm for VLSP(k1,k2), k1 2, was presented and it was claimed that the algorithm achieves the approximation ratio of 1 + (k1(k2 - k1))/k2. In this paper we give a problem instance for which the same algorithm obtains the approximation ratio ≈ k2/k1. We then present two simple approximation algorithms, one for the case k1 = 1 with an approximation ratio of 2, and one for the case k1 > 1 with an approximation ratio of 2 + (k2/2k1). This corrects the result claimed in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582).
AB - This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1,k2, denoted VLSP(k1,k2). In the current paper, we first discuss an error in the analysis of one of the approximation algorithms described in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582), where an approximation algorithm for VLSP(k1,k2), k1 2, was presented and it was claimed that the algorithm achieves the approximation ratio of 1 + (k1(k2 - k1))/k2. In this paper we give a problem instance for which the same algorithm obtains the approximation ratio ≈ k2/k1. We then present two simple approximation algorithms, one for the case k1 = 1 with an approximation ratio of 2, and one for the case k1 > 1 with an approximation ratio of 2 + (k2/2k1). This corrects the result claimed in (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), (2001) 569-582).
UR - http://www.scopus.com/inward/record.url?scp=0038577257&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0038577257&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(03)00141-5
DO - 10.1016/S0304-3975(03)00141-5
M3 - Article
AN - SCOPUS:0038577257
SN - 0304-3975
VL - 302
SP - 489
EP - 495
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-3
ER -