𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Time-Constrained Scheduling on Line Networks

✍ Scribed by Harald Räcke; Adi Rosén

Book ID
105915224
Publisher
Springer
Year
2011
Tongue
English
Weight
740 KB
Volume
49
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On polynomial-time approximation algorit
On polynomial-time approximation algorithms for the variable length scheduling problem
✍ Artur Czumaj; Leszek Ga̧sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

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 ÿrst discuss a