On polynomial-time approximation algorithms for the variable length scheduling problem

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 k 1, k 2, denoted VLSP( k 1, k 2). In the current paper, we first disc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 302; H. 1; S. 489 - 495
Hauptverfasser:	Czumaj, Artur, Ga̧sieniec, Leszek, Gaur, Daya Ram, Krishnamurti, Ramesh, Rytter, Wojciech, Zito, Michele
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 13.06.2003 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology Software Theoretical computing Scheduling Error analysis Computer theory Approximation algorithm VLSP problem Polynomial time
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!