On polynomial-time approximation algorithms for the...

Theoretical Computer Science 2003 Vol. 302; Iss. 1-3

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

Artur Czumaj, Leszek Ga̧sieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
302
Year:
2003
Language:
english
Pages:
7
DOI:
10.1016/s0304-3975(03)00141-5
File:
PDF, 195 KB
english, 2003
Conversion to is in progress
Conversion to is failed