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...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 302; číslo 1; s. 489 - 495
Hlavní autoři:	Czumaj, Artur, Ga̧sieniec, Leszek, Gaur, Daya Ram, Krishnamurti, Ramesh, Rytter, Wojciech, Zito, Michele
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 13.06.2003 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!