On the relationship between combinatorial and LP-based...

Theoretical Computer Science 2006 Vol. 361; Iss. 2-3

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems

R.N. Uma, Joel Wein, David P. Williamson
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:
361
Year:
2006
Language:
english
Pages:
16
DOI:
10.1016/j.tcs.2006.05.013
File:
PDF, 503 KB
english, 2006
Conversion to is in progress
Conversion to is failed